leetcode 965.单值二叉树

/*** Definition for a binary tree node.* struct TreeNode {*     int val;*     struct TreeNode *left;*     struct TreeNode *right;* };*/
//遍历判断函数
bool TreeCompare(struct TreeNode* root,int x)
{if(root == NULL)return true;if(root->val != x)return false;bool leftbool = TreeCompare(root->left,x);bool rightbool = TreeCompare(root->right,x);return leftbool && rightbool;
}bool isUnivalTree(struct TreeNode* root){return TreeCompare(root,root->val);
}