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
Note:
Bonus points if you could solve it both recursively and iteratively.
思路:
递归。。。
/**
* 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;
else
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;
else
return left.val == right.val && isSame(left.left, right.right) && isSame(left.right, right.left);
}
}
哎。刷的有点儿烦了。