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

Note:
Bonus points if you could solve it both recursively and iteratively.

代码：

/*判断左子树是否为右子树的镜像映射。  思路来自Leetcode讨论区 */

/*C++语言实现*/

class Solution {
public:
    bool isSymmetric(TreeNode* root) {
        return isMirror(root, root);
        }
private:    bool  isMirror(TreeNode *t1,TreeNode *t2){
            if( !t1 && !t2) return true;
            if (!t1 || !t2) return false;
            return (t1->val == t2->val)&&isMirror(t1->left, t2->right)&&isMirror(t1->right, t2->left);            
            }
};