树 - 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:

But the following [1,2,2,null,3,null,3] is not:

我的代码

/**
 * 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:
    bool isSymmetric(TreeNode* root) {
        if(root == NULL)  
            return true;  
        return helper(root->left, root->right); 
    }
    
    bool helper(TreeNode *root1, TreeNode *root2)  
    {  
        if(root1 == NULL && root2 == NULL)  
            return true;  
        if(root1 == NULL || root2 == NULL)  
            return false;  
        if(root1->val != root2->val)  
            return false;  
        return helper(root1->left,root2->right) && helper(root1->right,root2->left);  
    }  
};