LeetCode 965. Univalued Binary Tree

Tech In Pieces

于 2020-11-16 11:59:33 发布

阅读量156

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode Tree LeetCode Java

本文链接：https://blog.csdn.net/weixin_44337445/article/details/109718169

LeetCode 同时被 3 个专栏收录

370 篇文章

订阅专栏

Java

263 篇文章

订阅专栏

LeetCode Tree

37 篇文章

订阅专栏

这篇博客介绍了一种使用递归的方法来检查二叉树中所有节点的值是否相同，即判断是否为单值树。通过定义辅助函数`isUnivalTree`，比较当前节点值与给定的起始值，确保左右子树都为单值树，从而实现遍历整个树并验证其单值性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

check if every value on this tree is univalue or not.

using recursion and the equation will be:
isUnivalue(root) = isUnivalue(root.left) && isUnivalue(root.right)
but the problem is we don’t have the value to compare if any one is false.
so I use an extra recursion.

class Solution {
    public boolean isUnivalTree(TreeNode root) {
        if (root == null) return true;
        
        //if root is not null, then it means each value should have the same value as rppt.val
        return isUnivalTree(root, root.val);
    }
    
    private boolean isUnivalTree(TreeNode root, int value) {
        if (root == null) return true;
        
        if (root.val != value) return false;
        
        return isUnivalTree(root.left, value) && isUnivalTree(root.right, value);
    }
}