题目:
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.
解答:
逐层比较对称节点,依次递归。
代码:
/**
* Definition for binary tree
* 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 cmpSym(root.left,root.right);
}
public boolean cmpSym(TreeNode left,TreeNode right){
if(left == null && right == null)
return true;
else if(left == null || right == null)
return false;
else {
if(left.val != right.val)
return false;
else{
return cmpSym(left.left,right.right) && cmpSym(left.right,right.left);
}
}
}
}