leetcodeOJ 101. 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

代码如下：

/**
 * 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)
            return true;
        return isSymm(root->left, root->right);
    }
    
private:
    bool isSymm(TreeNode* left, TreeNode* right){
        if(left == NULL && right == NULL)   
            return true;
        else if(left && right && (left->val == right->val)){
            return isSymm(left->left, right->right) && isSymm(left->right, right->left);
            
        }
        return false;
    }
};