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

分析:递归过程.

<span style="font-size:14px;">/**
 * 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 symmetric(root.left,root.right);
        
    }
    public boolean symmetric(TreeNode l,TreeNode r){
        if(l==null&&r==null)
            return true;
        else if(l==null&&r!=null)
            return false;
        else if(l!=null&&r==null)
            return false;
        
        return l.val==r.val&&symmetric(l.left,r.right)&&symmetric(l.right,r.left);
        
    }
    
}</span>