对称树的判定

class Solution
{
public:
    bool isduicheng = true;
    bool isSymmetric(TreeNode *root)
    {
        // return root==nullptr||recur(root->left,root->right);
        if (root == nullptr)
        {
            return isduicheng;
        }
        recur(root->left, root->right);
        return isduicheng;
    }
    void recur(TreeNode *left, TreeNode *right)
    {
        if (left == nullptr || right == nullptr || left->val != right->val)
        {
            /* code */
            if (left == nullptr && right == nullptr)
            {
            }
            else
            {
                isduicheng = false;
            }
        }
        if (left != nullptr && right != nullptr)
        {
            recur(left->left, right->right);
            recur(left->right, right->left);
        }
    }
};