判断二叉树对称

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    bool compare(TreeNode* left,TreeNode* right){
        if(left == NULL && right == NULL)return true;
        else if(left != NULL && right == NULL)return false;
        else if(left == NULL && right != NULL)return false;
        else if(left->val != right->val )return false;
           bool outside = compare(left->left,right->right);
           bool inside = compare(left->right,right->left);
           bool issame = outside && inside;
           return issame;
    }
    bool isSymmetric(TreeNode* root) {
        /*比较的不是左孩子和右孩子，所以如下我称之为左节点右节点
        左节点为空，右节点不为空，不对称，return false
        左不为空，右为空，不对称 return false
        左右都为空，对称，返回true
        左右都不为空，比较节点数值，不相同就return false   ***

        递归逻辑  ：单层递归的逻辑就是处理 左右节点都不为空
        */
        if(root == NULL)return true;
        return compare(root->left,root->right);
    }
};