leetcode965. 单值二叉树

题目链接https://leetcode-cn.com/problems/univalued-binary-tree/

解题代码

/**
 * 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;
        }
        int val = root->val;
        return func(val, root);
    }

    bool func(int val, TreeNode* root){
        if(root==NULL){
            return true;
        }
        if(root->val != val){
            return false;
        }
        return func(val, root->left) && func(val, root->right);

    }
};

运行结果