leetcode 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

AC解，C++代码，菜鸟一个，请大家多多指正

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