Symmetric Tree - LintCode

描述
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
Bonus points if you could solve it both recursively and iteratively.

样例
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,#,3,#,3} is not:

    1
   / \
  2   2
   \   \
   3    3

思路
递归求解，利用修改先序遍历，对于一个二叉树，先访问右子树再访问左子树，
另一个二叉树就按先序遍历，若得到节点的值均相同，说明是对称的。

#ifndef C1360_H
#define C1360_H
#include<iostream>
using namespace std;
class TreeNode{
public:
    int val;
    TreeNode *left, *right;
    TreeNode(int val){
        this->val = val;
        this->left = this->right = NULL;
    }
};
class Solution {
public:
    /**
    * @param root: root of the given tree
    * @return: whether it is a mirror of itself
    */
    bool isSymmetric(TreeNode * root) {
        // Write your code here
        return helper(root, root);
    }
    //对于两颗二叉树,一个先访问左子树再访问右子树
    //另一个先访问右子树再访问左子树,访问到的节点值均相同可以说明对称
    bool helper(TreeNode *root1, TreeNode *root2)
    {
        if (!root1&&!root2)
            return true;
        if (!root1 || !root2)
            return false;
        if (root1->val != root2->val)
            return false;
        return helper(root1->left, root2->right) && helper(root1->right, root2->left);
    }
};
#endif