-
Notifications
You must be signed in to change notification settings - Fork 0
/
dec13.cpp
182 lines (166 loc) · 3.57 KB
/
dec13.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
176
177
178
#include<iostream>
using namespace std;
struct node
{
int info;
node * right , * left;
};
class BST
{
public:
node * root;
BST();
~BST();
void insertion(int , node * = NULL);
void removeall(node * = NULL);
void in_order_traversal(node * = NULL);
int count_nodes(node *);
void p_middle_val();
int traverse_upto(node * , int , int);
void remove(int , node * = NULL);
};
int main()
{
BST tree;
node * r = tree.root;
tree.insertion(40 , r);
tree.insertion(30 , r);
tree.insertion(20 , r);
tree.insertion(10 , r);
tree.insertion(5 , r);
tree.insertion(18 , r);
tree.insertion(17 , r);
tree.insertion(19 , r);
tree.insertion(28 , r);
tree.insertion(37 , r);
tree.insertion(50 , r);
tree.insertion(47 , r);
tree.insertion(48 , r);
tree.insertion(55 , r);
tree.insertion(57 , r);
tree.insertion(60 , r);
tree.insertion(64 , r);
tree.insertion(65 , r);
tree.insertion(66 , r);
tree.insertion(70 , r);
tree.insertion(80 , r);
tree.insertion(75 , r);
tree.insertion(82 , r);
tree.in_order_traversal();
cout << endl;
cout << tree.count_nodes(tree.root) << endl;
tree.p_middle_val();
return 0;
}
BST::BST()
{
root = NULL;
}
BST::~BST()
{
removeall();
}
void BST::insertion(int key , node * temp)
{
if(root == NULL)
{
root = new node;
root->right = root->left = NULL;
root->info = key;
return;
}
if(temp == NULL)
temp = root;
if(temp->info == key)
{
cout << "Duplication Not Allowed!" << endl;
return;
}
if(temp->info > key)
{
if(temp->left == NULL)
{
temp->left = new node;
temp = temp->left;
temp->left = temp->right = NULL;
temp->info = key;
return;
}
else
insertion(key , temp->left);
}
else
{
if(temp->right == NULL)
{
temp->right = new node;
temp = temp->right;
temp->left = temp->right = NULL;
temp->info = key;
return;
}
else
insertion(key, temp->right);
}
}
void BST::removeall(node * temp)
{
if(temp == NULL)
temp = root;
if(temp->left != NULL)
removeall(temp->left);
if(temp->right != NULL)
removeall(temp->right);
delete temp;
}
void BST::in_order_traversal(node * temp)
{
if(root == NULL)
{
cout << "[ ]" << endl;
return;
}
if(temp == NULL)
temp = root;
if(temp->left != NULL)
in_order_traversal(temp->left);
cout << temp->info << ' ';
if(temp->right != NULL)
in_order_traversal(temp->right);
}
int BST::count_nodes(node * temp)
{
if(root == NULL)
return 0;
int count = 1;
if(temp->left != NULL)
count += count_nodes(temp->left);
if(temp->right != NULL)
count += count_nodes(temp->right);
return count;
}
void BST::p_middle_val()
{
int count = count_nodes(root);
if(count == 0)
{
cout << "Empty Tree!" << endl;
return;
}
count = (count / 2) + 1;
traverse_upto(root , count , 0);
}
int BST::traverse_upto(node * temp , int count , int current)
{
if(temp->left != NULL)
current = traverse_upto(temp->left , count , current);
current++;
if(count == current)
{
cout << temp->info << endl;
return 0;
}
if(temp->right != NULL)
current = traverse_upto(temp->right , count , current);
return current;
}