mfocko/LeetCode
mfocko/LeetCode
1
0
Fork 0
Code Issues Pull requests Wiki Activity

cs: add “1448. Count Good Nodes in Binary Tree”

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2024-01-07 21:09:16 +01:00
parent 7e9a865db7
commit 19bc5bb150
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 25 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

25
cs/count-good-nodes-in-binary-tree.cs Normal file
View file

@ -0,0 +1,25 @@
/**
* Definition for a binary tree node.
* public class TreeNode {
* public int val;
* public TreeNode left;
* public TreeNode right;
* public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
public class Solution {
private int GoodNodes(TreeNode root, int m) {
if (root == null) {
return 0;
}
int newMax = Math.Max(m, root.val);
return (root.val >= m ? 1 : 0) + GoodNodes(root.left, newMax) + GoodNodes(root.right, newMax);
}
public int GoodNodes(TreeNode root) => GoodNodes(root, int.MinValue);
}