Leetcode-965 Univalued Binary Tree(单值二叉树)

class Solution
{
    public:
        bool PreOrderTraverse (TreeNode* T,int data)
        {
            if(T)
            {
                if(T->val!=data)
                    return false;
                if(!PreOrderTraverse (T -> left,data))
                    return false;
                if(!PreOrderTraverse (T -> right,data))
                    return false ;
            }
            return true;
        }
        bool isUnivalTree(TreeNode* root)
        {
            return PreOrderTraverse(root,root->val);
        }
};