250. Count Univalue Subtrees

/**
 * 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:
    int countUnivalSubtrees(TreeNode* root) {
        count = 0;
        dfs(root);
        return count;
    }
    
private:
    int count;
    int dfs(TreeNode*root)
    {
        if(!root) return INT_MAX;
        int left = dfs(root->left);
        int right = dfs(root->right);
        
        if(left==INT_MAX&&right==INT_MAX){count++;return root->val;}
        else if(left==INT_MAX || right==INT_MAX)
        {
            if(root->val == left || root->val == right){count++;return root->val;}
            else return INT_MIN;
        }
        else
        {
            if(root->val==left&&root->val==right){count++;return root->val;}
            else return INT_MIN;
        }
    }
};