题目
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).
For example, this binary tree is symmetric:
But the following is not:
解
/**
* 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 isSame(root.left,root.right);
}
public boolean isSame(TreeNode left,TreeNode right){
if(left==null && right==null)
return true;
if(left==null && right!=null || left!=null && right==null){
return false;
}
if(left.val!=right.val)
return false;
return isSame(left.left,right.right) && isSame(left.right,right.left);
}
}