统计唯一值子树个数

给定一棵二叉树，统计唯一值子树的数目.

唯一值子树意味着子树的所有节点都具有相同的值.

样例

样例1

输入: root = {5,1,5,5,5,#,5}
输出: 4
解释:
              5
             / \
            1   5
           / \   \
          5   5   5

样例2

输入: root = {1,3,2,4,5,#,6}
输出: 3
解释:
              1
             / \
            3   2
           / \   \
          4   5   6

 

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: the given tree
     * @return: the number of uni-value subtrees.
     */
    int count;
    int countUnivalSubtrees(TreeNode * root) {
        // write your code here
        count = 0;
        bianli(root);
        return count;
    }
    
    void bianli(TreeNode* root)
    {
        if(root != NULL)
        {
            if(isequal(root, root->val))
                count++;
            bianli(root->left);
            bianli(root->right);
        }
    }
    
    bool isequal(TreeNode* root, int val)
    {
        if(root == NULL)
            return true;
        else if(root->val != val)
            return false;
        return isequal(root->left,val) && isequal(root->right,val);
    }
    
    

};