请实现一个函数,用来判断一棵二叉树是不是对称的。注意,如果一个二叉树同此二叉树的镜像是同样的,定义其为对称的。
解析:递归,镜像对比一下,最左和最右相同,依次递归(注意代码最后一行)
代码:
/*
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}
*/
public class Solution {
boolean isSymmetrical(TreeNode pRoot)
{
if(pRoot == null){
return true;
}
return judge(pRoot.left, pRoot.right);
}
private boolean judge( TreeNode left, TreeNode right){
if(left == null){
return (right == null);
}
if(right == null){
return false;
}
if(right.val != left.val)
return false;
return judge(left.left, right.right)&& judge(left.right,right.left);
}
}