-
Notifications
You must be signed in to change notification settings - Fork 0
/
f6.cpp
72 lines (68 loc) · 1.35 KB
/
f6.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
63
64
65
66
67
68
69
70
71
72
#include<iostream>
using namespace std;
struct node
{
int info;
node * left , * right;
};
void checking_CBT(node * temp)
{
if(temp == NULL)
{
cout << "Empty Tree" << endl;
return;
}
if(Check_CBT(&temp , 1 , false))
cout << "It is CBT" << endl;
else
cout << "It is Not CBT" << endl;
}
bool Check_CBT(node ** temp, int size, bool no_child_flag)
{
int n_size = 0;
for(int i = 0; i < size; i++)
{
if(temp[i]->left != NULL)
{
if(no_child_flag)
return false;
n_size++;
}
else
{
no_child_flag = true;
}
if(temp[i]->right != NULL)
{
if(no_child_flag)
return false;
n_size++;
}
else
{
no_child_flag = true;
}
}
if(n_size == 0)
return true;
node ** next_lev = new node *[n_size];
int cur_index = 0;
for(int i = 0; i < size; i++)
{
if(temp[i]->left!= NULL)
{
next_lev[cur_index] = temp[i]->left;
cur_index++;
}
if(temp[i]->right != NULL)
{
next_lev[cur_index] = temp[i]->right;
cur_index++;
}
}
return Check_CBT(next_lev , n_size , no_child_flag);
}
int main()
{
return 0;
}