-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathtree.c
169 lines (157 loc) · 3.25 KB
/
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
#include <assert.h>
#include <stdlib.h>
#include "tree.h"
static tree_t *join(tree_t *, tree_t *);
static tree_t *split(tree_t *, size_t);
tree_t *
t_put(tree_t *root, tree_t *node,
int32_t (*f)(const tree_t *, const tree_t *)) {
assert(node && f);
if (root) {
if (f(root, node) <= 0) {
root->left = t_put(root->left, node, f);
} else {
root->right = t_put(root->right, node, f);
}
return root;
}
return node;
}
tree_t *
t_erase(tree_t *root, tree_t *node,
int32_t (*c)(const tree_t *, const tree_t *), void (*f)(tree_t *)) {
assert(node && c);
if (root) {
int32_t compare = c(root, node);
if (!compare) {
tree_t *tmp = root;
root = join(root->left, root->right);
if (f)
f(tmp);
free(tmp);
} else if (compare < 0) {
root->left = t_erase(root->left, node, c, f);
} else {
root->right = t_erase(root->right, node, c, f);
}
return root;
}
return NULL;
}
tree_t *
t_free(tree_t *root, void (*f)(tree_t *)) {
if (root) {
root->left = t_free(root->left, f);
root->right = t_free(root->right, f);
if (f)
f(root);
free(root);
}
return NULL;
}
tree_t *
t_find(tree_t *root, tree_t *node,
int32_t (*f)(const tree_t *, const tree_t *)) {
assert(node && f);
if (root) {
int32_t compare = f(root, node);
if (!compare)
return root;
if (compare < 0) {
return t_find(root->left, node, f);
} else {
return t_find(root->right, node, f);
}
}
return NULL;
}
tree_t *
t_balance(tree_t *root) {
size_t size = t_size(root);
if (size >= 2) {
root = split(root, size / 2);
root->left = t_balance(root->left);
root->right = t_balance(root->right);
}
return root;
}
size_t
t_size(tree_t *root) {
if (root)
return 1 + t_size(root->left) + t_size(root->right);
return 0;
}
size_t
t_depth(tree_t *root) {
if (root) {
size_t left = 1 + t_depth(root->left);
size_t right = 1 + t_depth(root->right);
if (left > right) {
return left;
} else {
return right;
}
}
return 0;
}
tree_t *
t_node(tree_t *root, size_t position) {
if (root) {
size_t size = t_size(root->left);
if (size > position)
return t_node(root->left, position);
if (size < position)
return t_node(root->right, position - size - 1);
return root;
}
return NULL;
}
tree_t *
t_iter(tree_t *root, int32_t (*pre)(tree_t *), int32_t (*in)(tree_t *),
int32_t (*post)(tree_t *)) {
if (root) {
tree_t *node;
if (pre && pre(root))
return root;
if ((node = t_iter(root->left, pre, in, post)) != NULL)
return node;
if (in && in(root))
return root;
if ((node = t_iter(root->right, pre, in, post)) != NULL)
return node;
if (post && post(root))
return root;
}
return NULL;
}
static tree_t *
join(tree_t *root1, tree_t *root2) {
if (root2) {
root2 = split(root2, 0);
root2->left = root1;
return root2;
}
return root1;
}
static tree_t *
split(tree_t *root, size_t position) {
if (root) {
size_t size = t_size(root->left);
if (size > position) {
root->left = split(root->left, position);
tree_t *node = root->left;
root->left = node->right;
node->right = root;
root = node;
}
if (size < position) {
root->right = split(root->right, position - size - 1);
tree_t *node = root->right;
root->right = node->left;
node->left = root;
root = node;
}
return root;
}
return NULL;
}