简单粗暴
/**
* 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 {
private:
int init = -1;
public:
bool isUnivalTree(TreeNode* root) {
if(!root) return 1;
if(init<0) init = root->val;
if(root->val != init) return false;
return isUnivalTree(root->right) && isUnivalTree(root->left);
}
};