FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Data-Structure-Algorithm/14BST.cpp at main · mayurgalhate/Data-Structure-Algorithm · GitHub
mayurgalhate
/
Data-Structure-Algorithm
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Data-Structure-Algorithm
/
14BST.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
195 lines (161 loc) · 3.68 KB
Breadcrumbs
Data-Structure-Algorithm
/
14BST.cpp
Copy path
File metadata and controls
195 lines (161 loc) · 3.68 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#
include
<
iostream
>
#
include
<
queue
>
using
namespace
std
;
class
Node
{
public:
int
data;
Node* left;
Node* right;
Node
(
int
d){
this
->
data
= d;
this
->
left
=
NULL
;
this
->
right
=
NULL
;
}
};
pair<
bool
,
int
>
isBalanced
(Node* root){
if
(root ==
NULL
){
pair<
bool
,
int
>p =
make_pair
(
true
,
0
);
return
p;
}
pair<
int
,
int
> left =
isBalanced
(root->
left
);
pair<
int
,
int
> right =
isBalanced
(root->
right
);
bool
leftAns = left.
first
;
bool
rightAns = right.
first
;
bool
diff =
abs
(left.
second
- right.
second
) <=
1
;
pair<
bool
,
int
> ans ;
ans.
second
=
max
(left.
second
,right.
second
) +
1
;
if
(leftAns && rightAns && diff){
ans.
first
=
true
;
}
else
{
ans.
first
=
false
;
}
return
ans;
}
Node *
levelOrderTraversal
(Node *root)
{
queue<Node *> q;
q.
push
(root);
q.
push
(
NULL
);
while
(!q.
empty
())
{
Node *temp = q.
front
();
q.
pop
();
if
(temp ==
NULL
)
{
cout << endl;
if
(!q.
empty
())
{
q.
push
(
NULL
);
}
}
else
{
cout << temp->
data
<<
"
"
;
if
(temp->
left
)
{
q.
push
(temp->
left
);
}
if
(temp->
right
)
{
q.
push
(temp->
right
);
}
}
}
}
Node*
insertInBST
(Node* root ,
int
d){
//
base case
if
(root ==
NULL
){
root =
new
Node
(d);
return
root;
}
//
for right
if
(d > root->
data
){
root->
right
=
insertInBST
(root->
right
, d);
}
//
for left
if
(d < root->
data
){
root->
left
=
insertInBST
(root->
left
, d);
}
return
root;
}
Node*
minVal
(Node* root){
Node* temp = root;
while
(temp->
left
!=
NULL
){
temp = temp->
left
;
}
return
temp;
}
Node*
maxVal
(Node* root){
Node* temp = root;
while
(temp->
right
!=
NULL
){
temp = temp->
right
;
}
return
temp;
}
Node*
deletefromBST
(Node* root ,
int
val){
if
(root ==
NULL
){
return
root;
}
if
(root->
data
== val){
//
0
if
(root->
left
==
NULL
&& root->
right
==
NULL
){
delete
root;
return
NULL
;
}
//
1
//
left
if
(root->
left
!=
NULL
&& root->
right
==
NULL
){
Node* temp = root->
left
;
delete
root;
return
temp;
}
//
right
if
(root->
left
==
NULL
&& root->
right
!=
NULL
){
Node* temp = root->
right
;
delete
root;
return
temp;
}
//
2
if
(root->
left
!=
NULL
&& root->
right
!=
NULL
){
//
find min val from right 'or' max value from left
int
mini =
minVal
(root->
right
)->
data
;
//
copy data in root data
root->
data
= mini;
//
delete mini
root->
right
=
deletefromBST
(root->
right
, mini);
return
root;
}
}
else
if
(root->
data
> val){
root->
left
=
deletefromBST
(root->
left
, val);
return
root;
}
else
{
root->
right
=
deletefromBST
(root->
right
, val);
return
root;
}
}
void
takeInput
(Node* &root ){
int
data;
cin>>data;
while
(data != -
1
){
root =
insertInBST
(root , data);
cin>>data;
}
}
int
main
(){
Node* root =
NULL
;
cout <<
"
Enter data to create BST:
"
<< endl;
takeInput
(root);
cout <<
"
Printing BST
"
<< endl;
levelOrderTraversal
(root);
cout <<
"
Min val data:
"
<<
minVal
(root)->
data
<<endl;
cout <<
"
Max val data:
"
<<
maxVal
(root)->
data
<<endl;
root =
deletefromBST
(root ,
110
);
cout <<
"
Printing BST
"
<< endl;
levelOrderTraversal
(root);
cout <<
"
Min val data:
"
<<
minVal
(root)->
data
<<endl;
cout <<
"
Max val data:
"
<<
maxVal
(root)->
data
<<endl;
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL