/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
public boolean isUnivalTree(TreeNode root) {
return isUnivalTree(root, root.val);
}
private boolean isUnivalTree(TreeNode root, int val) {
if (root==null)
return true;
if(root.val != val)
return false;
boolean left = isUnivalTree(root.left, val);
boolean right = isUnivalTree(root.right, val);
return left&&right;
}
}