题目描述
请实现一个函数,用来判断一颗二叉树是不是对称的。注意,如果一个二叉树同此二叉树的镜像是同样的,定义其为对称的。
/*
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 judgeChild(pRoot.left, pRoot.right);
}
private boolean judgeChild(TreeNode left, TreeNode right){
if(left == null)
return right == null;
if(right == null)
return false;
if(left.val != right.val)
return false;
return (judgeChild(left.left, right.right) && judgeChild(left.right, right.left));
}
}