-
Notifications
You must be signed in to change notification settings - Fork 0
/
Judge_son_in_tree.cpp
62 lines (58 loc) · 1.21 KB
/
Judge_son_in_tree.cpp
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
//
// Created by defjia on 18-4-26.
//
#define NON_RECURSION
#define LEN 100
#define NO 0
#define YES 1
#include <cstdio>
#include <cstdlib>
#include <queue>
using namespace std;
int L[LEN] = {0, 2, 4, 6, 0, 7, 0, 0, 0, 0};
int R[LEN] = {0, 3, 5, 0, 0, 8, 9, 0, 0, 0};
int u, v, i = 9;
#ifdef RECURSION
bool Judge_child(int u, int v){
if(u == v) return YES;
if(L[v]) if(Judge_child(u, L[v])) return YES;
if(R[v]) if(Judge_child(u, R[v])) return YES;
return NO;
}
int main(){
if(scanf("%d%d", &u, &v) != 2) exit(1);
if(u > i || v > i) exit(1);
if(u == v) return NO;
if(Judge_child(u, v)) return YES;
else return NO;
}
#endif
#ifdef NON_RECURSION
int main(){
queue<int> tmp;
int p;
if(scanf("%d%d", &u, &v) != 2) exit(1);
if(u > i || v > i) exit(1);
tmp.push(v);
while(!tmp.empty()){
p = tmp.front();
tmp.pop();
if(L[p]){
if (L[p] == u){
p = 0;
break;
}
tmp.push(L[p]);
}
if(R[p]){
if(R[p] == u) {
p = 0;
break;
}
tmp.push(R[p]);
}
}
if(p == 0) return YES;
else return NO;
}
#endif