-
Notifications
You must be signed in to change notification settings - Fork 0
/
binarytree.cpp
220 lines (182 loc) · 3.86 KB
/
binarytree.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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
// insert
Node* insert(Node* root,int x)
{
if(root==nullptr)
{
return new Node(x);
}
if(x<root->key)
{
root->left=insert(root->left,x);
}
if(x>root->key)
{
root->right=insert(root->right,x);
}
return root;
}
//iterative
Node *insert(Node *root, int x){
Node *temp=new Node(x);
Node *parent=NULL,*curr=root;
while(curr!=NULL){
parent=curr;
if(curr->key>x)
curr=curr->left;
else if(curr->key<x)
curr=curr->right;
else
return root;
}
if(parent==NULL)
return temp;
if(parent->key>x)
parent->left=temp;
else
parent->right=temp;
return root;
}
// delete from bst
Node* findSuccessor(Node* root)
{
root=root->right;
while(root!=nullptr && root->left!=nullptr)
{
root=root->left;
}
}
Node *delNode(Node *root, int x)
{
if(root==nullptr)
{
return root;
}
if(root->key==x)
{if(root->left==NULL){
Node *temp=root->right;
delete root;
return temp;
}
else if(root->right==NULL){
Node *temp=root->left;
delete root;
return temp;
}
else{
Node* succ=findSuccessor(root);
root->key=succ->key;
root->right=delNode(root->right,succ->key);
}
}
else if(root->key<x)
{
root->right=delNode(root->right,x);
}
else
root->left==delNode(root->left,x);
return root;
}
//floor in Bst
Node *floor(Node *root, int x)
{
Node* res{nullptr};
while(root!=nullptr)
{
if(x>root->key)
{
res=root;
root=root->right;
}
else if(x<root->key)
{
root=root->left;
}
else
return root;
}
return res;
}
//ceil in bst
Node *ceil(Node *root, int x)
{
Node* res{};
while(root!=nullptr)
{
if(x<root->key)
{
res=root;
root=root->left;
}
else if(x>root->key)
{
root=root->right;
}
else return root;
}
return res;
}
// read map and set now
// functionslike insert, erase,find,count,clear,begin(),end(),[] operator in map,empty(),size();
// ceil on the left side in an array
void printCeiling(int arr[], int n){
cout<<"-1"<<" ";
set<int> s;
s.insert(arr[0]);
for(int i=1;i<n;i++){
if(s.lower_bound(arr[i])!=s.end())
cout<<*(s.lower_bound(arr[i]))<<" ";
else
cout<<"-1"<<" ";
s.insert(arr[i]);
}
}
// fix bst with 2 nodes swapped
Node* first{NULL};
Node* second{NULL};
Node* prev{NULL};
void fixBST(Node* root) {
if(root==nullptr)
{return ;}
fixBST(root->left);
if( prev!=nullptr && prev->key>root->key)
{
if(first==nullptr)
{
first=prev;
}
second=root;
}
prev=root;
fixBst(root->right);
}
// sum of nodes in same vertical line
void vSumR(Node *root,int hd,map<int,int> &mp){
if(root==NULL)return;
vSumR(root->left,hd-1,mp);
mp[hd]+=root->key;
vSumR(root->right,hd+1,mp);
}
// print vertical elements(vertical traversal)
void vTraversal(Node *root){
map<int,vector<int>> m{};
queue<pair<Node*,int>> q{};
q.insert({root,0});
while(q.empty()==false)
{
auto x= q.front();
q.pop();
int vl= x.second;
Node* temp= x.first;
m[vl].push_back(temp.key);
if(temp->left!=NULL)
q.push({temp->left,vl-1});
if(temp->right!=NULL)
q.push({temp->right,vl+1});
}
for(auto x:m){
for(int y:x.second)
cout<<y<<" ";
cout<<endl;
}
}
// top view and bottom view are similar to the above