leetcode 每日一题  965. 单值二叉树

class Solution {
    public boolean isUnivalTree(TreeNode root) {
        if (root == null) {
            return true;
        }
        if(root.left != null && root.left.val != root.val){
            return false;
        }
        if(root.right != null && root.right.val != root.val){
            return false;
        }
        return isUnivalTree(root.left) && isUnivalTree(root.right);
    }
}

标签：965,isUnivalTree,return,val,right,二叉树,&&,root,leetcode
来源： https://www.cnblogs.com/yexuba/p/16304194.html