题目:965. 单值二叉树
思路:深度优先搜索dfs,弄一个全局标记flag,遇到不相等的时候,flag置为0。
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
bool flag=1;
void dfs(TreeNode* root,int u){
if(root==nullptr) return;
if(root->val!=u){
flag=0;
return;
}
dfs(root->left,u);
dfs(root->right,u);
}
bool isUnivalTree(TreeNode* root) {
dfs(root,root->val);
return flag;
}
};