-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathIsomorphism of trees
183 lines (177 loc) · 3.81 KB
/
Isomorphism of trees
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#define N 100
int ReadTree(char data[N],int ls[N],int rs[N],int *n);
void FindFirstRoot(int a[N],int s[N],int n);
void CompareTree(int first1,int first2);
char data1[N];
int ls1[N],rs1[N];
char data2[N];
int ls2[N],rs2[N];
int n[2];
int flag=1;
int main()
{
int first1,first2;
first1=ReadTree(data1,ls1,rs1,&n[0]);
first2=ReadTree(data2,ls2,rs2,&n[1]);
if(n[0]!=0&&n[1]!=0)
{
CompareTree(first1,first2);
}
else if(n[0]==0&&n[1]==0)
{
flag=1;
}
else
{
flag=-1;
}
if(flag==1)
{
printf("Yes");
}
else
{
printf("No");
}
return 0;
}
void CompareTree(int first1,int first2)
{
if(data1[first1]==data2[first2])
{
if(ls1[first1]!=-1&&ls2[first2]!=-1&&rs1[first1]!=-1&&rs2[first2]!=-1)
{
if(data1[ls1[first1]]==data2[ls2[first2]])
{
if(data1[rs1[first1]]==data2[rs2[first2]])
{
CompareTree(ls1[first1],ls2[first2]);
CompareTree(rs1[first1],rs2[first2]);
}
}
else if(data1[ls1[first1]]==data2[rs2[first2]])
{
if(data1[rs1[first1]]==data2[ls2[first2]])
{
CompareTree(ls1[first1],rs2[first2]);
CompareTree(rs1[first1],ls2[first2]);
}
}
else
{
flag= -1;
}
}
else if(ls1[first1]==-1&&ls2[first2]==-1&&rs1[first1]!=-1&&rs2[first2]!=-1)
{
if(data1[rs1[first1]]==data2[rs2[first2]])
{
CompareTree(rs1[first1],rs2[first2]);
}
else
{
flag= -1;
}
}
else if(ls1[first1]==-1&&ls2[first2]!=-1&&rs1[first1]!=-1&&rs2[first2]==-1)
{
if(data1[rs1[first1]]==data2[ls2[first2]])
{
CompareTree(rs1[first1],ls2[first2]);
}
else
{
flag= -1;
}
}
else if(ls1[first1]!=-1&&ls2[first2]==-1&&rs1[first1]==-1&&rs2[first2]!=-1)
{
if(data1[ls1[first1]]==data2[rs2[first2]])
{
CompareTree(ls1[first1],rs2[first2]);
}
else
{
flag= -1;
}
}
else if(ls1[first1]!=-1&&ls2[first2]!=-1&&rs1[first1]==-1&&rs2[first2]==-1)
{
if(data1[ls1[first1]]==data2[ls2[first2]])
{
CompareTree(ls1[first1],ls2[first2]);
}
else
{
flag= -1;
}
}
else if(ls1[first1]==-1&&ls2[first2]==-1&&rs1[first1]==-1&&rs2[first2]==-1)
{
}
else
{
flag= -1;
}
}
else
{
flag= -1;
}
}
int ReadTree(char data[N],int ls[N],int rs[N],int *n)
{
int a[N]={0};
int i;
int firstRoot=0;
char Ls,Rs;
scanf("%d",n);
for(i=0;i<*n;i++)
{
getchar();
scanf("%c %c %c",&data[i],&Ls,&Rs);
if(Ls!='-')
{
ls[i]=Ls-'0';
}
else
{
ls[i]=-1;
}
if(Rs!='-')
{
rs[i]=Rs-'0';
}
else
{
rs[i]=-1;
}
}
FindFirstRoot(a,ls,*n);
FindFirstRoot(a,rs,*n);
for(i=0;i<*n;i++)
{
if(a[i]==0)
{
firstRoot=i;
break;
}
}
return firstRoot;
}
void FindFirstRoot(int a[N],int s[N],int n)
{
int i;
for(i=0;i<n;i++)
{
if(s[i]!=-1)
{
a[s[i]]=1;
}
}
}