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

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

对对称的子树进行比较 代码如下：

public class Solution {
    public boolean isSymmetric(TreeNode root) {
      if(root==null)return true;
      return isv(root.left, root.right);  
    }
    public boolean isv(TreeNode left,TreeNode right){
        if(left==null&&right==null)return true;
        if(left==null&&right!=null)return false;
        if(left!=null&&right==null)return false;
        if(left.val!=right.val)return false;
        return isv(left.left,right.right)&&isv(left.right,right.left);
    }
}

还想到用中序遍历来做 但是有两组数据不能通过 针对性地改过之后还有一组不能通过 看来中序验证不是充分条件 代码如下：

List<Integer> res=new ArrayList<Integer>();
    public boolean isSymmetric(TreeNode root) {
      if(root==null)return true;
      TreeNode head=new TreeNode(1);
      head.left=root;
      isv(root,head);
      for(int i=0;i<res.size()/2;i++){
          if(res.get(i)!=res.get(res.size()-i-1)){
              return false;
          }
      }
      return true; 
    }
    public void isv(TreeNode root,TreeNode pre){
        if(root==null) {
            if(pre.left!=null||pre.right!=null){
                res.add(0);
            }
            return;
        }
        isv(root.left,root);
        res.add(root.val);
        isv(root.right,root);
    }