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