-
Notifications
You must be signed in to change notification settings - Fork 0
/
AVL.c
146 lines (128 loc) · 2.4 KB
/
AVL.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
#include <stdio.h>
typedef struct binary_tree
{
int item;
int h;
struct binary_tree *left;
struct binary_tree *right;
}b_tree;
b_tree *create_b_tree(int item)
{
b_tree *new_tree = (b_tree *) malloc(sizeof(b_tree));
new_tree->item = item;
new_tree->left = new_tree->right = NULL;
return new_tree;
}
b_tree *create_empty_b()
{
return NULL;
}
int is_balanced(b_tree *tree)
{
int bf = h(tree->left) - h(tree->right);
return ((-1 <=bf) && (bf <=1));
}
int max(int a, int b)
{
return (a > b)? a : b;
}
int h(b_tree *tree)
{
if (tree == NULL){
return -1;
}else{
return 1 + max(h(tree->left), h(tree->right));
}
}
int b_factor(b_tree *tree)
{
if (tree == NULL){
return 0;
}else if ((tree->left != NULL) && (tree->right != NULL)){
return (tree->left->h - tree->right->h);
}else if((tree->left != NULL) && (tree->right == NULL)){
return (1 + tree->left->h);
}else{
return (-tree->right->h -1);
}
}
b_tree *rotate_left(b_tree *tree)
{
b_tree *aux = NULL;
if (tree != NULL && tree->right != NULL){
aux = tree->right;
tree->right = aux->left;
aux->left = tree;
}
aux->h = h(aux);
tree->h = h(tree);
return aux;
}
b_tree *rotate_right(b_tree *tree)
{
b_tree *aux = NULL;
if (tree != NULL && tree->left != NULL){
aux = tree->left;
tree->left = aux->right;
aux->right = tree;
}
aux->h = h(aux);
tree->h = h(tree);
return aux;
}
b_tree *add(b_tree *tree, int item)
{
if(tree == NULL){
return create_b_tree(item);
}else if(tree->item > item){
tree->left = add(tree->left, item);
}else{
tree->right = add(tree->right, item);
}
tree->h = h(tree);
b_tree* child;
if (b_factor(tree) == 2 || b_factor(tree) == -2){
if(b_factor(tree) == 2){
child = tree->left;
if(b_factor(child) == -1){
tree->left = rotate_left(child);
}
tree = rotate_right(tree);
}else if (b_factor(tree) == -2){
child = tree->right;
if(b_factor(child) == 1){
tree->right = rotate_right(child);
}
tree = rotate_left(tree);
}
}
return tree;
}
void free_tree(b_tree *tree)
{
if(tree == NULL)
return;
free_tree(tree->left);
free_tree(tree->right);
free(tree);
}
void printOrder(b_tree* tree)
{
if(tree == NULL) return;
else{
printf(" %d ", tree->item);
printOrder(tree->left);
printOrder(tree->right);
}
}
int main()
{
b_tree *tree = create_empty_b();
int n;
while(scanf("%d", &n) != EOF){
tree = add(tree, n);
}
printOrder(tree);
free_tree(tree);
return 0;
}