[LeetCode OJ]Symmetric Tree

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

For example, this binary tree is symmetric:

    1
   / \
  2   2
 / \ / \

3  4 4  3

But the following is not:

    1
   / \
  2   2
   \   \

   3    3

前面比较好多次，感觉有些麻烦，不过有没想到更好的方法。。。

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    bool ischecked(TreeNode *rootLeft, TreeNode *rootRight) {
        if(rootLeft == NULL && rootRight == NULL)
            return true;
        
        if(rootLeft == NULL && rootRight != NULL)
            return false;
            
        if(rootLeft != NULL && rootRight == NULL)
            return false;
            
        return (rootLeft->val == rootRight->val) && ischecked(rootLeft->left, rootRight->right) && ischecked(rootLeft->right, rootRight->left);
    }
    
    bool isSymmetric(TreeNode *root) {
        if(root == NULL)
            return true;
        
        return ischecked(root->left, root->right);
    }
};