给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2,则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的,因为我们把其中一棵树的结点A、B、G的左右孩子互换后,就得到另外一棵树。而图2就不是同构的。
图1
图2
现给定两棵树,请你判断它们是否是同构的。
输入格式:
输入给出2棵二叉树树的信息。对于每棵树,首先在一行中给出一个非负整数NNN (≤10\le 10≤10),即该树的结点数(此时假设结点从0到N−1N-1N−1编号);随后NNN行,第iii行对应编号第iii个结点,给出该结点中存储的1个英文大写字母、其左孩子结点的编号、右孩子结点的编号。如果孩子结点为空,则在相应位置上给出“-”。给出的数据间用一个空格分隔。注意:题目保证每个结点中存储的字母是不同的。
输出格式:
如果两棵树是同构的,输出“Yes”,否则输出“No”。
输入样例1(对应图1):
8
A 1 2
B 3 4
C 5 -
D - -
E 6 -
G 7 -
F - -
H - -
8
G - 4
B 7 6
F - -
A 5 1
H - -
C 0 -
D - -
E 2 -
输出样例1:
Yes
输入样例2(对应图2):
8
B 5 7
F - -
A 0 3
C 6 -
H - -
D - -
G 4 -
E 1 -
8
D 6 -
B 5 -
E - -
H - -
C 0 2
G - 3
F - -
A 1 4
输出样例2:
No
import java.util.Scanner;
class Node {
String key;
int left;
int right;
}
public class test1 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
Node[] arr1 = new Node[8];
Node[] arr2 = new Node[8];
int treeHead1 = buildTree(arr1, sc);
int treeHead2 = buildTree(arr2, sc);
boolean result = isomorphism(arr1, treeHead1, arr2, treeHead2);
if (result)
System.out.println("YES");
else
System.out.println("NO");
}
public static int buildTree(Node[] arr, Scanner sc) {
String tmpLeft;
String tmpRight;
int root = 0;
int N = sc.nextInt();
int[] flag = new int[N];
for (int i = 0; i < N; i++) {
Node node = new Node();
node.key = sc.next();
tmpLeft = sc.next();
tmpRight = sc.next();
arr[i] = node;
if (tmpLeft.equals("-")) {
node.left = -1;
} else {
node.left = Integer.parseInt(tmpLeft);
flag[node.left] = 1;
}
if (tmpRight.equals("-")) {
node.right = -1;
} else {
node.right = Integer.parseInt(tmpRight);
flag[node.right] = 1;
}
}
for (int i = 0; i < N; i++) {
if (flag[i] == 0) {
root = i;
break;
}
}
return root;
}
public static boolean isomorphism(Node[] arr1, int head1, Node[] arr2, int head2) {
if (head1 == -1 && head2 == -1)
return true;
if (head1 == -1 && head2 != -1 || head1 != -1 && head2 == -1)
return false;
if (!(arr1[head1].key.equals(arr2[head2].key))) {
return false;
}
//如果树1.左和树2.左都空,只要比较树1.右和树2.右
//如果树1.左和树2.左都不空,并且值相等,那么比较树1.左和树2.左 && 树1.右和树2.右
//否则比较 树1.左和树2.右 && 树1.右和树2.左
if ((arr1[head1].left == -1) && (arr2[head2].left == -1))
return isomorphism(arr1, arr1[head1].right, arr2, arr2[head2].right);
if (((arr1[head1].left != -1) && (arr2[head2].left != -1))
&& (arr1[arr1[head1].left].key.equals(arr2[arr2[head2].left].key))) {
return isomorphism(arr1, arr1[head1].left, arr2, arr2[head2].left)
&& isomorphism(arr1, arr1[head1].right, arr2, arr2[head2].right);
} else {
return isomorphism(arr1, arr1[head1].left, arr2, arr2[head2].right)
&& isomorphism(arr1, arr1[head1].right, arr2, arr2[head2].left);
}
}
}
/*
8
A 1 2
B 3 4
C 5 -
D - -
E 6 -
G 7 -
F - -
H - -
8
G - 4
B 7 6
F - -
A 5 1
H - -
C 0 -
D - -
E 2 -
YES
8
B 5 7
F - -
A 0 3
C 6 -
H - -
D - -
G 4 -
E 1 -
8
D 6 -
B 5 -
E - -
H - -
C 0 2
G - 3
F - -
A 1 4
NO
*/