给定两棵树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 <cstdio>
#include <string>
#define MAX 10
using namespace std;
typedef struct {
int id;
char ch;
int left;
int right;
} Node;
Node TreeA[MAX];
Node TreeB[MAX];
int isRoot[MAX];
bool Isomorphism( int AIndex, int BIndex ) {
if( AIndex == -1 && BIndex == -1 ) {
return true;
}
if( ( ( AIndex == -1 ) && ( BIndex != -1 ) ) ||
( ( AIndex != -1 ) && ( BIndex == -1 ) ) ) {
return false;
}
if( TreeA[AIndex].ch != TreeB[BIndex].ch ) {
return false;
}
if( ( TreeA[AIndex].left == -1 ) && ( TreeB[BIndex].left == -1 ) ) {
return Isomorphism( TreeA[AIndex].right, TreeB[BIndex].right );
}
if( ( ( TreeA[AIndex].left != -1 ) && ( TreeB[BIndex].left != -1 ) ) &&
( ( TreeA[TreeA[AIndex].left].ch ) == ( TreeB[TreeB[BIndex].left].ch ) ) ) {
return ( Isomorphism( TreeA[AIndex].left, TreeB[BIndex].left ) ) &&
( Isomorphism( TreeA[AIndex].right, TreeB[BIndex].right ) );
}
else {
return ( Isomorphism( TreeA[AIndex].left, TreeB[BIndex].right ) &&
( Isomorphism( TreeA[AIndex].right, TreeB[BIndex].left ) ) );
}
}
int buildTree( int n, Node Tree[] ) {
char ch, left, right;
char c = getchar();
if( n ) {
for( int i = 0; i < n; i++ ) {
Tree[i].id = i;
scanf( "%c %c %c", &ch, &left, &right );
Tree[i].ch = ch;
c = getchar();
if( left == '-' ) {
Tree[i].left = -1;
}
else {
Tree[i].left = left - '0';
isRoot[left - '0'] = 1;
}
if( right == '-' ) {
Tree[i].right = -1;
}
else {
Tree[i].right = right - '0';
isRoot[right - '0'] = 1;
}
}
for( int i = 0; i < n; i++ ) {
if( isRoot[i] == 0 ) {
return i;
}
}
}
return -1;
}
int main() {
//freopen( "123.txt", "r", stdin );
int N;
scanf( "%d", &N );
int ARoot = buildTree( N, TreeA );
fill( isRoot, isRoot + MAX, 0 );
scanf( "%d", &N );
int BRoot = buildTree( N, TreeB );
//printf( "%d %d\n", ARoot, BRoot );
//for( int i = 0; i < N; i++ ) {
// printf( "%d %d %d\n", TreeA[i].id, TreeA[i].left, TreeA[i].right );
//}
bool flag = Isomorphism( ARoot, BRoot );
if( flag ) {
printf( "Yes" );
}
else {
printf( "No" );
}
return 0;
}