-
Notifications
You must be signed in to change notification settings - Fork 0
/
BST.c
181 lines (104 loc) · 3.45 KB
/
BST.c
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 <stdio.h>
#include <stdlib.h>
struct Node{
int data;
struct Node *left;
struct Node *right;
};
/*
struct Node *newNode(int key,struct Node *root){
if(root == NULL){
root = malloc(sizeof(struct Node));
root -> data = key;
root -> left = NULL;
root -> right = NULL;
}
return root;
}
*/
int getMinNode(struct Node *root){
struct Node *temp=root ;
while(temp->left != NULL){
temp = temp -> left;
}
return temp->data;
}
struct Node *getNewNode(int val){
struct Node *newNode = malloc(sizeof(struct Node));
newNode -> data = val;
newNode -> left = NULL;
newNode -> right = NULL;
return newNode;
}
struct Node *insertNode(struct Node *root,int val){
if(root == NULL){
return getNewNode(val);
}
if(val < root -> data)
root->left = insertNode(root->left,val);
else
if(val > root -> data)
root->right = insertNode(root->right,val);
return root;
}
void PrintNode(struct Node *root){
if(root == NULL)
return;
else{
PrintNode(root->left);
printf("%d ",root->data);
PrintNode(root->right);
}
}
struct Node *removeNode(struct Node *root,int val){
if(root == NULL)
return NULL;
else
if(val < root -> data)
root -> left = removeNode(root->left,val);
else
if(val > root -> data)
root -> right = removeNode(root->right,val);
else{
if(root -> left == NULL && root -> right == NULL){
free(root);
return NULL;
}
else
if(root -> left == NULL){
struct Node *temp = root -> right;
free(root);
return temp;
}
else
if(root -> right == NULL){
struct Node *temp = root -> left;
free(root);
return temp;
}
else{
int getMinVal = getMinNode(root->right);
root -> data = getMinVal;
root -> right = removeNode(root->right,getMinVal);
}
}
return root;
}
int main(){
struct Node *root = NULL;
//root = newNode(key,root);
root = insertNode(root,10);
printf("Root -> data = %d",root->data);
printf("\n");
root = insertNode(root,8);
root = insertNode(root,6);
root = insertNode(root,4);
root = insertNode(root,14);
root = insertNode(root,13);
root = insertNode(root,16);
root = insertNode(root,15);
PrintNode(root);
root = removeNode(root,14);
printf("\n");
PrintNode(root);
}