给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2,则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的,因为我们把其中一棵树的结点A、B、G的左右孩子互换后,就得到另外一棵树。而图2就不是同构的。
图1
图2
现给定两棵树,请你判断它们是否是同构的。
输入格式:
输入给出2棵二叉树树的信息。对于每棵树,首先在一行中给出一个非负整数N (≤10),即该树的结点数(此时假设结点从0到N−1编号);随后N行,第i行对应编号第i个结点,给出该结点中存储的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
#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 10
typedef char ElemType;
typedef struct Node {
ElemType data;
ElemType left;
ElemType right;
}node;
typedef struct nodes {
node a[MAXSIZE];
}Nodes,*qNode;
int main()
{
int count1 = 0;
scanf("%d\n", &count1);
qNode q = (Nodes *)malloc(sizeof(Nodes));
for (int i = 0;i < count1;i++) {
scanf("%c %c %c ", &q->a[i].data,&q->a[i].left,&q->a[i].right);
}
int count2 = 0;
qNode p = (Nodes *)malloc(sizeof(Nodes));
scanf("%d\n", &count2);
for (int i = 0;i < count2;i++) {
scanf("%c %c %c ", &p->a[i].data, &p->a[i].left, &p->a[i].right);
}
char leftDA, rightDA;
int flag = 1;
if (count1 != count2) {
flag = 0;
}
else if(count1==1){
if (q->a[0].data != p->a[0].data) {
flag = 0;
}
}
else {
int flag2 = 1;
for (int i = 0;i < count1&&flag == 1;i++) {
flag2 = 1;
for (int j = 0;j < count2&&flag == 1 && flag2 == 1;j++) {
if (p->a[j].data == q->a[i].data) {
if (p->a[j].left == '-'&&q->a[i].left == '-') {
if (p->a[j].right == '-'&&q->a[i].right == '-') {
flag2 = 0;
continue;
}
else if (p->a[j].right == '-'&&q->a[i].right != '-' || p->a[j].right != '-'&&q->a[i].right == '-') {
flag = 0;
break;
}
else {
if (p->a[(p->a[j].right) - '0'].data == q->a[(q->a[i].right) - '0'].data) {
flag2 = 0;
continue;
}
else {
flag = 0;
break;
}
}
}
else if (p->a[j].right == '-'&&q->a[i].left == '-') {
if (p->a[j].left == '-'&&q->a[i].right == '-') {
flag2 = 0;
continue;
}
else if (p->a[j].left == '-'&&q->a[i].right != '-' || p->a[j].left != '-'&&q->a[i].right == '-') {
flag = 0;
break;
}
else {
if (p->a[(p->a[j].left) - '0'].data == q->a[(q->a[i].right) - '0'].data) {
flag2 = 0;
continue;
}
else {
flag = 0;
break;
}
}
}
else if (p->a[j].right != '-'&&q->a[i].left != '-'&&p->a[j].left != '-'&&q->a[i].right != '-') {
if (p->a[(p->a[j].left) - '0'].data == q->a[(q->a[i].right) - '0'].data&&p->a[(p->a[j].right) - '0'].data == q->a[(q->a[i].left) - '0'].data ||
p->a[(p->a[j].right) - '0'].data == q->a[(q->a[i].right) - '0'].data&&p->a[(p->a[j].left) - '0'].data == q->a[(q->a[i].left) - '0'].data) {
flag2 = 0;
continue;
}
else
{
flag = 0;
break;
}
}
else if (p->a[j].left == '-'&&q->a[i].right == '-') {
if (p->a[j].right == '-'&&q->a[i].left == '-') {
flag2 = 0;
continue;
}
else if (p->a[j].right == '-'&&q->a[i].left != '-' || p->a[j].right != '-'&&q->a[i].left == '-') {
flag = 0;
break;
}
else {
if (p->a[(p->a[j].right) - '0'].data == q->a[(q->a[i].left) - '0'].data) {
flag2 = 0;
continue;
}
else {
flag = 0;
break;
}
}
}
else if (p->a[j].right == '-'&&q->a[i].right == '-') {
if (p->a[j].left == '-'&&q->a[i].left == '-') {
flag2 = 0;
continue;
}
else if (p->a[j].left == '-'&&q->a[i].left != '-' || p->a[j].left != '-'&&q->a[i].left == '-') {
flag = 0;
break;
}
else {
if (p->a[(p->a[j].left) - '0'].data == q->a[(q->a[i].left) - '0'].data) {
flag2 = 0;
continue;
}
else {
flag = 0;
break;
}
}
}
else {
flag = 0;
break;
}
}
}
}
}
if (flag == 0) {
printf("No");
}
else {
printf("Yes");
}
return 0;
}