This repository was archived by the owner on Oct 2, 2018. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 84
Expand file tree
/
Copy pathBST.cpp
More file actions
181 lines (142 loc) · 2.44 KB
/
BST.cpp
File metadata and controls
181 lines (142 loc) · 2.44 KB
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
#include <iostream>
using namespace std;
//NODE
struct node
{
int data;
node *left;
node *right;
node *parent;
};
node *root=NULL, *ptr;
//INSERT
node* insert(node *root, int key){
if(root==NULL){
ptr = new node;
ptr->data = key;
ptr->left=NULL;
ptr->right=NULL;
ptr->parent=NULL;
root= ptr;
return root;
}
else if(key<=root->data){
root->left = insert(root->left, key);
root->parent = root;
}else if(key>root->data){
root->right = insert(root->right, key);
root->parent=root;
}
return root;
}
//INORDER TRAERSAL
void inorder(node *root){
if(root==NULL){
return;
}
inorder(root->left);
cout<<root->data<<" ";
inorder(root->right);
}
//PRE ORDER TRAVERSAL
void preorder(node *root){
if(root==NULL){
return;
}
cout<<root->data<<" ";
inorder(root->left);
inorder(root->right);
}
//POST ORDER TRAVERSAL
void postorder(node *root){
if(root==NULL){
return;
}
inorder(root->left);
inorder(root->right);
cout<<root->data<<" ";
}
//SEARCH
node* search(node *root, int key){
if(root==NULL){
return root;
}
if(root->data==key){
return root;
}
return search(root->left, key);
return search(root->right, key);
}
//FIND MIN NODE
node* FindMin(node* root){
if(root==NULL){
return root;
}
if(root->left==NULL){
return root;
}
return FindMin(root->left);
}
//FINDMAX NODE
node* FindMax(node* root){
if(root==NULL){
return root;
}
if(root->right==NULL){
return root;
}
return FindMin(root->right);
}
//DELETE A NODE
node* dele(node *root, int key){
if(root==NULL){
return root;
}
else if(key<root->data){
root->left = dele(root->left, key);
}else if (key>root->data){
root->right = dele(root->right, key);
}else{
//NO CHILD
if(root->left==NULL && root->right==NULL){
delete root;
root=NULL;
}
//ONE CHILD
else if(root->left==NULL){
node *temp = root;
root=root->right;
delete temp;
}
else if(root->right==NULL){
node *temp = root;
root=root->left;
delete temp;
}
//TWO CHILD
else{
node *temp = FindMin(root->right);
root->data = temp->data;
root->right= dele(root->right, temp->data);
}
}
return root;
}
int main(){
//CREATE A TREE
root = insert(root,50);
insert(root,23);
insert(root,18);
insert(root,25);
insert(root, 60);
insert(root, 67);
//INORDER TRAVERSE
inorder(root);
//SEARCH FOR A DATA
cout<<"\n\n"<<search(root,23)->data;
//DELETE A DATA
dele(root, 23);
cout<<"\n\n";
inorder(root);
return 0;
}