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?

依然还是树的递归问题，这类递归不像之前的没有返回值，这种是有返回值的（这里要返回真或者假），这种类型的写法也比较固定，下面是经典例子

思路：比较根节点的左边子树的节点和根节点右边子树对应位置的节点是否对称，来判断一个树是否为对称树。当然了，首先要判断是否为一棵树

代码如下：

/**
 * 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) {
        if(root==null) return true;
        return symetric(root.left,root.right);
    }
    
    public boolean symetric(TreeNode leftNode,TreeNode rightNode){
      if(leftNode==null&&rightNode==null) return true;
      if(leftNode==null||rightNode==null) return false;
      if(leftNode.val!=rightNode.val) return false;
      
      boolean isLeft = symetric(leftNode.left,rightNode.right);
      boolean isRight = symetric(leftNode.right,rightNode.left);
      
      return isLeft && isRight;
    }   
        
}