-
Notifications
You must be signed in to change notification settings - Fork 128
/
AVL Tree.cpp
167 lines (137 loc) · 3.24 KB
/
AVL Tree.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
#include <bits/stdc++.h>
using namespace std;
struct Node{
int data;
Node* left;
Node* right;
int height;
Node(int x){
this->data = x;
left=NULL;
right=NULL;
height=0;
}
};
int height(Node* node)
{
if(!node)return 0;
return node->height;
}
int balance(Node* node)
{
if(!node)return 0;
return height(node->left) - height(node->right);
}
Node* leftRotate(Node* node)
{
Node* rightNode = node->right;
Node* leftOfRight = rightNode->left;
node->right = leftOfRight;
rightNode->left = node;
node->height = 1+ max(height(node->left),height(node->right));
rightNode->height = 1+ max(height(rightNode->left),height(rightNode->right));
return rightNode;
}
Node* rightRotate(Node* node)
{
Node* leftNode = node->left;
Node* rightOfLeft = leftNode->right;
node->left = rightOfLeft;
leftNode->right = node;
node->height = 1+ max(height(node->left),height(node->right));
leftNode->height = 1+ max(height(leftNode->left),height(leftNode->right));
return leftNode;
}
Node* insert(Node* root,int x)
{
if(!root)
return new Node(x);
if(root->data>x)
root->left=insert(root->left,x);
else
root->right=insert(root->right,x);
root->height=1+max(height(root->left),height(root->right));
int bal=balance(root);
// Left Left case
if(bal > 1 && x < root->left->data)
return rightRotate(root);
// Right Right Case
if(bal < -1 && x > root->right->data)
return leftRotate(root);
// Left Right Case
if (bal > 1 && x > root->left->data)
{
root->left = leftRotate(root->left);
return rightRotate(root);
}
// Right Left Case
if (bal < -1 && x < root->right->data)
{
root->right = rightRotate(root->right);
return leftRotate(root);
}
/* return the (unchanged) node pointer */
return root;
}
Node* inorderSuccessor(Node* node)
{
Node* cur=node;
while(cur&&cur->right)
cur=cur->right;
return cur;
}
Node* remove(Node* root,int x)
{
if(!root)return root;
if(root->data>x)
root->left=remove(root->left,x);
else if(root->data<x)
root->right=remove(root->right,x);
else
{
if(!root->left&&!root->right)
return NULL;
if(!root->left)
{
Node* temp=root->right;
free(root);
return temp;
}
if(!root->right)
{
Node* temp=root->left;
free(root);
return temp;
}
Node* temp=inorderSuccessor(root->right);
root->data=temp->data;
root->right=remove(root->right,root->data);
return root;
}
}
void inorder(Node* root)
{
if(!root)return;
inorder(root->left);
cout<<root->data<<" ";
inorder(root->right);
}
int main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#endif
Node* root=NULL;
int n;cin>>n;
while(n--)
{
int x;cin>>x;
root=insert(root,x);
}
inorder(root);
// root=remove(root,8);
cout<<"\n";
inorder(root);
return 0;
}