Symmetric Tree

Symmetric Tree

描述：

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree [1,2,2,3,4,4,3] is symmetric:
1
/ \
2 2
/ \ / \
3 4 4 3
But the following [1,2,2,null,3,null,3] is not:
1
/ \
2 2
\ \
3 3

题解：

bool isSymmetric(TreeNode* root){
        if(root==nullptr) return true;
        return isMirror(root->left, root->right);
    }
    
bool isMirror(TreeNode* left, TreeNode* right){
    if(!(left!=nullptr&&right!=nullptr)) 
        return left==right;
    return (left->val==right->val)&&
                isMirror(left->left, right->right)&&
                isMirror(left->right, right->left);