思路
如果根节点为null,返回true。如果根节点值和左右子树值相同并且左右子树都是单值树返回true
代码实现
/**
* 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 {
// 如果根节点为null,返回true。如果根节点值和左右子树值相同并且左右子树都是单值树返回true
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);
}
}