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代码如下：

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