package sort;
public class Test28 {
public static void main(String[] args) {
BinayTreeNode root = new BinayTreeNode(1, null, null);
root.left = new BinayTreeNode(2, null, null);
root.right = new BinayTreeNode(2, null, null);
root.right.right=new BinayTreeNode(3, null, null);
root.left.left = new BinayTreeNode(3, null, null);
System.out.println(isSym(root));
}
private static boolean isSym(BinayTreeNode root) {// 入口这要求其左右子树对称
// TODO Auto-generated method stub
return isSym(root.left, root.right);
}
private static boolean isSym(BinayTreeNode left, BinayTreeNode right) {
// TODO Auto-generated method stub
if (left == null && right == null)// 左右子树要嘛都为空
return true;
if (left == null || right == null)// 左右一个为空则返回false
return false;
if (left.value != right.value)// 左右子树节点的值不同,则返回false
return false;
return isSym(left.left, right.right) && isSym(left.right, right.left);
// 递归循环体,直到都为空
}
}