如果二叉树每个节点都具有相同的值,那么该二叉树就是单值二叉树。
只有给定的树是单值二叉树时,才返回 true
;否则返回 false
。
示例 1:
输入:[1,1,1,1,1,null,1] 输出:true
示例 2:
输入:[2,2,2,5,2] 输出:false
提示:
给定树的节点数范围是 [1, 100]
。
每个节点的值都是整数,范围为 [0, 99]
。
C
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* struct TreeNode *left;
* struct TreeNode *right;
* };
*/
bool func(struct TreeNode* Node,int value)
{
if(NULL==Node)
{
return true;
}
else
{
return value==Node->val && func(Node->left,value) && func(Node->right,value);
}
}
bool isUnivalTree(struct TreeNode* root)
{
int value=root->val;
return func(root->left,value) && func(root->right,value);
}
C++
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
bool func(TreeNode* Node, int value)
{
if(NULL==Node)
{
return true;
}
else
{
return value==Node->val && func(Node->left,value) && func(Node->right,value);
}
}
bool isUnivalTree(TreeNode* root)
{
int value=root->val;
return func(root->left,value) && func(root->right,value);
}
};
python
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution:
def func(self, Node, value):
if None==Node:
return True
else:
return value==Node.val and self.func(Node.left,value) and self.func(Node.right,value)
def isUnivalTree(self, root):
"""
:type root: TreeNode
:rtype: bool
"""
value=root.val
return self.func(root.left,value) and self.func(root.right,value)