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 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.
confused what "{1,#,2,3}" means? > read more on how binary tree is serialized on OJ.
 
 

  
  

  
  OJ's Binary Tree Serialization:
  
  
The serialization of a binary tree follows a level order traversal, where '#' signifies a path terminator where no node exists below.
  
  
Here's an example:

  
  
   1
  / \
 2   3
    /
   4
    \
     5
The above binary tree is serialized as 
  
  "{1,2,3,#,#,4,#,#,5}".
 
 
 
 

  
  

 
 
 
 

  
  这道题不需要左右旋，只是一个比较大小的问题
 
 
 
 

  
  /**
  
  
 * Definition for a binary tree node.
  
  
 * public class TreeNode {
  
  
 *     int val;
  
  
 *     TreeNode left;
  
  
 *     TreeNode right;
  
  
 *     TreeNode(int x) { val = x; }
  
  
 * }
  
  
 */
  
  
public class Solution {
  
  
    public boolean isSymmetric(TreeNode root) {
  
  
        return root==null||zhenjia(root.left,root.right);
  
  
    }
  
  
    private boolean zhenjia(TreeNode left,TreeNode right)
  
  
    {
  
  
        if(left==null&&right==null)return true;
  
  
        else if(left==null&&right!=null)return false;
  
  
        else if(left!=null&&right==null)return false;
  
  
        return left.val==right.val?zhenjia(left.left,right.right)&&zhenjia(left.right,right.left):false;
  
  
    }
  
  
}
  
  

 
 
 
 

  
  java中对象比较尽量不要用==，==指向的是对象是否引用一样
 
 
 
 

  
  
    对Boolean、Character、Byte、Shot、Integer、Long、Float、Double 来说，和String一样：，==是比较地址的，equals()是比较内容的。这些java自带的封装类里重载好了。
  
  
    equals():在object中，是用来比较内存地址的，但是在String以及上面提到的几个类里，是比较内容的，即使是不同地址，只要内容一致，返回true;
  
  
    ==：在哪里都是比较地址（除了java自带类型——int a = 3 ; int b = 3; 这里a和b，地址不同，但它们是自带类型，直接比较值，依然返回true）