题目:请实现一个函数,用来判断一棵二叉树是不是对称的。注意,如果一个二叉树同此二叉树的镜像是同样的,定义其为对称的。
思路:
递归比较左边的左子树与右边的右子树、左边的右子树与右边的左子树。
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
import java.util.*;
public class Solution {
boolean isSymmetrical(TreeNode pRoot) {
if(pRoot == null || (pRoot.left == null && pRoot.right == null))
return true;
return isSymmetrical2(pRoot.left,pRoot.right);
}
boolean isSymmetrical2(TreeNode left,TreeNode right){
if(left == null && right == null){
return true;
}
if(left == null || right == null){
return false;
}
if(left.val != right.val){
return false;
}
return isSymmetrical2(left.left,right.right) && isSymmetrical2(left.right,right.left);
}
}