965. Univalued Binary Tree

965. Univalued Binary Tree

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution {
    int num=0;
    public boolean isUnivalTree(TreeNode root) {
        if(root==null){
            return true;
        }
         num=root.val;
        //System.out.println("num: "+num);
        return helper(root,num);
    }
    
    public boolean helper(TreeNode root,int num){
        if(root==null){
            return true;
        }
        System.out.println("num: "+num);
        System.out.println("root: "+root.val);
        if(root.val!=num){
            return false;
        }
        //check 左边遍历返回的值
        if(!helper(root.left,num)){
            return false;
        }
        
        if(!helper(root.right,num)){
            return false;
        }
        return true;
    }
    
}