对称的二叉树
请实现一个函数,用来判断一颗二叉树是不是对称的。注意,如果一个二叉树同此二叉树的镜像是同样的,定义其为对称的。
public class SymmetricBinaryTrees {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] pre = { 1, 2, 4, 7, 3, 5, 6, 8 };// 前序遍历序列
int[] in = { 4, 7, 2, 1, 5, 3, 8, 6 };// 中序遍历序列
TreeNode root = reConstructBinaryTree(pre, in);// 调用重建二叉树方法 ;
System.out.print(isSymmetrical(root));
}
// 重建二叉树
public static TreeNode reConstructBinaryTree(int[] pre, int[] in) {
if (pre == null || in == null) {
return null;
}
java.util.HashMap<Integer, Integer> map = new java.util.HashMap<Integer, Integer>();
for (int i = 0; i < in.length; i++) {
map.put(in[i], i);
}
return preIn(pre, 0, pre.length - 1, in, 0, in.length - 1, map);
}
public static TreeNode preIn(int[] p, int pi, int pj, int[] n, int ni, int nj,
java.util.HashMap<Integer, Integer> map) {
if (pi > pj) {
return null;
}
TreeNode head = new TreeNode(p[pi]);
int index = map.get(p[pi]);
head.left = preIn(p, pi + 1, pi + index - ni, n, ni, index - 1, map);
head.right = preIn(p, pi + index - ni + 1, pj, n, index + 1, nj, map);
return head;
}
public static boolean isSymmetrical(TreeNode pRoot) {
if (pRoot == null) {
return true;
}
return isSymmetrical(pRoot.left, pRoot.right);
}
public static boolean isSymmetrical(TreeNode left, TreeNode right) {
if (left == null && right == null) {
return true;
}
if (left == null || right == null) {
return false;
}
if (left.val == right.val) {
return isSymmetrical(left.left, right.right) && isSymmetrical(left.right, right.left);
}
return false;
}
}
public class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
public TreeNode(int val) {
this.val = val;
}
}