-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST_isBalanced.cpp
175 lines (142 loc) · 2.87 KB
/
BST_isBalanced.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
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
// // BinarySearchTree.cpp
#include <iostream>
#include <queue>
#include <cmath>
using namespace std;
class node {
public:
int data;
node* left;
node* right;
node(int d): data(d), left(NULL), right(NULL) {}
};
void preOrder(node* root) {
// base case
if (root == NULL) {
return;
}
// recursive case
cout << root->data << ",";
preOrder(root->left);
preOrder(root->right);
}
void inOrder(node* root) {
// base case
if (root == NULL) {
return;
}
inOrder(root->left);
cout << root->data << ",";
inOrder(root->right);
}
void postOrder(node* root) {
// base case
if (root == NULL) {
return;
}
// recursive case
postOrder(root->left);
postOrder(root->right);
cout << root->data << " ";
}
/////////////////////////////// LEVEL ORDER //////////////////////////
void PrintLevel(node* root) {
queue<node*> q;
q.push(root);
q.push(NULL);
while (!q.empty()) {
node* x = q.front(); // x can be an valid address or NULL
q.pop();
if ( x == NULL) {
cout << endl;
if (!q.empty()) {
q.push(NULL);
}
}
else {
cout << x->data << " ";
if (x->left) {
q.push(x->left);
}
if (x->right) {
q.push(x->right);
}
}
}
}
/////////////////////////////// !LEVEL ORDER //////////////////////////
/////////////////////////////// Create BST //////////////////////////
node* InsertInBST(node* root, int data) {
// base case
if (root == NULL) {
root = new node(data);
return root;
}
// recursive case
if (data <= root->data) {
root->left = InsertInBST(root->left, data);
}
else {
root->right = InsertInBST(root->right, data);
}
return root;
}
node* BuildTree() {
node* root = NULL;
int data;
cin >> data;
while (data != -1) {
root = InsertInBST(root, data);
cin >> data;
}
return root;
}
///////////
//////Is Balanced ///
class Pair {
public:
int height;
bool Balanced;
Pair(): height (0), Balanced(true) {}
};
Pair IsBalanced(node* root)
{
Pair p;
//base case
if (root == NULL)
{
return p;
}
Pair left = IsBalanced(root->left);
Pair right = IsBalanced(root->right);
//recursive case
p.height = max(left.height, right.height) + 1;
if (left.Balanced and right.Balanced and abs(left.height - right.height) <= 1)
{
p.Balanced = true;
}
else
{
p.Balanced = false;
}
return p;
};
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
node* root = BuildTree();
// preOrder(root);
// cout << endl;
inOrder(root);
cout << endl;
PrintLevel(root);
Pair ans = IsBalanced(root);
cout << "height of the current tree " << ans.height << endl;
if (ans.Balanced == true)
cout << " The tree is Balanced " << endl;
else
cout << "The tree is not balanced" << endl;
return 0;
}