【Count Good Nodes in Binary Tree】

最新推荐文章于 2024-09-16 20:08:29 发布

正在沿着IT树往上爬

最新推荐文章于 2024-09-16 20:08:29 发布

阅读量388

点赞数

分类专栏： LeetCode 文章标签：二叉树节点最大值递归路径

本文链接：https://blog.csdn.net/weixin_39400958/article/details/124103683

版权

LeetCode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.
Return the number of good nodes in the binary tree.
Example 1:
在这里插入图片描述

Input: root = [3,1,4,3,null,1,5]
Output: 4
Explanation: Nodes in blue are good.
Root Node (3) is always a good node.
Node 4 -> (3,4) is the maximum value in the path starting from the root.
Node 5 -> (3,4,5) is the maximum value in the path
Node 3 -> (3,1,3) is the maximum value in the path.

Example 2:
在这里插入图片描述

Input: root = [3,3,null,4,2]
Output: 3
Explanation: Node 2 -> (3, 3, 2) is not good, because "3" is higher than it.

Example 3:

Input: root = [1]
Output: 1
Explanation: Root is considered as good.

Constraints:

The number of nodes in the binary tree is in the range [1, 10⁵].
Each node’s value is between [-10⁴, 10⁴].

Java Completion:

class Solution {
    public int goodNodes(TreeNode root) {
        int max = Integer.MIN_VALUE;
        return recursiveNode(root, max);
    }

    public int recursiveNode(TreeNode root, int max) {
        if (root == null) return 0;
        int goodCount = root.val >= max ? 1 : 0;
        int leftGoodCount = recursiveNode(root.left, Math.max(root.val, max));
        int rightGoodCount = recursiveNode(root.right, Math.max(root.val, max));
        return goodCount + leftGoodCount + rightGoodCount;
    }
}