LeetCode 965. 【递归】单值二叉树
原题链接
简单
作者:
大明湖的鱼
,
2021-01-20 23:42:29
,
所有人可见
,
阅读 246
/**
* 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 isUnivalTree(TreeNode* root) {
if(root == NULL) return true;
else if(root->left && root->left->val != root->val) return false;
else if(root->right && root->right->val != root->val) return false;
return isUnivalTree(root->left) && isUnivalTree(root->right);
}
};