-
Notifications
You must be signed in to change notification settings - Fork 0
/
binary_tree.c
213 lines (160 loc) · 5.54 KB
/
binary_tree.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
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
#include <stdio.h>
#include <stdlib.h>
#include "queue.h"
struct node {
int value;
struct node *left;
struct node *right;
};
/* iterativno pronalazi poziciju novog cvora i dodaje ga u BST */
/* vraca pokazivac na dodani cvor ili postojeci sa istom vrijednoscu */
/* pretpostavlja se da je stablo vec BST */
struct node *bst_add_iterative(struct node **root, int value) {
while (*root != NULL) {
if ((*root)->value > value)
root = &(*root)->left;
else if ((*root)->value < value)
root = &(*root)->right;
else
/* duplikat: (*root)->value == value */
return *root;
}
*root = malloc(sizeof(struct node));
(*root)->value = value;
(*root)->left = NULL;
(*root)->right = NULL;
return *root;
}
/* rekurzivno pronalazi poziciju novog cvora i dodaje ga u BST */
/* vraca pokazivac na dodani cvor ili postojeci sa istom vrijednoscu */
/* pretpostavlja se da je stablo vec BST */
struct node *bst_add_recursive(struct node **root, int value) {
if (*root == NULL) {
*root = malloc(sizeof(struct node));
(*root)->value = value;
(*root)->left = NULL;
(*root)->right = NULL;
return *root;
} else if ((*root)->value > value)
return bst_add_recursive(&(*root)->left, value);
else if ((*root)->value < value)
return bst_add_recursive(&(*root)->right, value);
else
/* duplikat: (*root)->value == value */
return *root;
}
/* iterativno pronalazi poziciju cvora sa vrijednoscu value */
/* vraca pokazivac na pronadjeni cvor ili NULL ukoliko niti jedan cvor nema vrijednost value */
/* pretpostavlja se da je stablo vec BST */
struct node *bst_find_iterative(struct node *root, int value) {
while (root != NULL) {
if (root->value > value)
root = root->left;
else if (root->value < value)
root = root->right;
else
/* pronasli: root->value == value */
return root;
}
return NULL;
}
/* rekurzivno pronalazi poziciju cvora sa vrijednoscu value */
/* vraca pokazivac na pronadjeni cvor ili NULL ukoliko niti jedan cvor nema vrijednost value */
/* pretpostavlja se da je stablo BST */
struct node *bst_find_recursive(struct node *root, int value) {
if (root == NULL)
return NULL;
else if (root->value > value)
return bst_find_recursive(root->left, value);
else if (root->value < value)
return bst_find_recursive(root->right, value);
else
/* pronasli: root->value == value */
return root;
}
/* racuna visinu stabla */
int tree_height(struct node *root) {
int height_l, height_r;
if (root == NULL)
return 0;
height_l = tree_height(root->left); /* racunaj visinu lijevog podstabla */
height_r = tree_height(root->right); /* racunaj visinu desnog podstabla */
/* visina trenutnog (pod)stabla je veca od visine lijevog odnosno desnog podstabla
* uvecano za 1 tj. visinu trenutnog cvora */
return 1 + (height_l > height_r ? height_l : height_r);
}
/* ispisuje sve cvorove stabla u preorder poretku */
void tree_print_preorder(struct node *root) {
if (root == NULL)
return;
printf("%d ", root->value); /* ispisi trenutni cvor */
tree_print_preorder(root->left); /* preorder poretkom ispisi lijevo podstablo */
tree_print_preorder(root->right); /* preorder poretkom ispisi desno podstablo */
}
/* ispisuje sve cvorove stabla u postorder poretku */
void tree_print_postorder(struct node *root) {
if (root == NULL)
return;
tree_print_postorder(root->left); /* postorder poretkom ispisi lijevo podstablo */
tree_print_postorder(root->right); /* postorder poretkom ispisi desno podstablo */
printf("%d ", root->value); /* ispisi trenutni cvor */
}
/* ispisuje sve cvorove stabla u inorder poretku */
void tree_print_inorder(struct node *root) {
if (root == NULL)
return;
tree_print_inorder(root->left); /* inorder poretkom ispisi lijevo podstablo */
printf("%d ", root->value); /* ispisi trenutni cvor */
tree_print_inorder(root->right); /* inorder poretkom ispisi desno podstablo */
}
/* ispisuje sve cvorove stabla u levelorder poretku */
/* typedef void * queue_element_t; */
void tree_print_levelorder(struct node *root) {
/* iz reda cemo povlaciti trenutni cvor za ispis,
* te istovremeno u njega dodavati djecu tog cvora */
/* typedef void * queue_element_t */
queue_t queue = queue_new();
/* ispis pocinje sa korijenom stabla */
if (root != NULL)
queue_enqueue(queue, root);
while (!queue_is_empty(queue)) {
struct node *current = (struct node *) queue_dequeue(queue);
printf("%d ", current->value); /* ispisi trenutni cvor */
if (current->left != NULL)
queue_enqueue(queue, current->left); /* dodaj u red lijevo podstablo */
if (current->right != NULL)
queue_enqueue(queue, current->right); /* dodaj u red desno podstablo */
}
queue_delete(queue);
}
/* oslobadja svu dinamicki alociranu memoriju za stablo */
void tree_free(struct node *root) {
if (root == NULL)
return;
tree_free(root->left); /* oslobodi memoriju za sve cvorove iz lijevog podstabla */
tree_free(root->right); /* oslobodi memoriju za sve cvorove iz desnog podstabla */
free(root); /* oslobodi memoriju za trenutni cvor */
}
void tree_print_leaves(struct node *root) {
if (root == NULL)
return;
if (root->left == NULL && root->right == NULL)
printf("%d ", root->value);
tree_print_leaves(root->left);
tree_print_leaves(root->right);
}
int tree_equal(struct node *root1, struct node *root2) {
if (root1 == NULL && root2 == NULL)
return 1;
if (root1 == NULL && root2 != NULL)
return 0;
if (root1 != NULL && root2 == NULL)
return 0;
if (root1->value != root2->value)
return 0;
if (!tree_equal(root1->left, root2->left))
return 0;
if (!tree_equal(root1->right, root2->right))
return 0;
return 1;
}