blob: 1f3b215460faa27f51b194e198868ac372040439 (
plain) (
blame)
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
|
#include "tree.h"
static inline TreeNode * newTreeNode() {
TreeNode * ret = malloc(sizeof(TreeNode));
ret->data[0] = NULL;
ret->data[1] = NULL;
ret->children[0] = NULL;
ret->children[1] = NULL;
ret->children[2] = NULL;
return ret;
}
static inline void freeTreeNode(TreeNode * node) {
free(node);
}
Tree * newTree(TreeFreeDataFunc * freeFunc, TreeCompareDataFunc * compareFunc) {
Tree * ret = malloc(sizeof(Tree));
ret->headNode = NULL;
ret->freeFunc = freeFunc;
ret->compareFunc = compareFunc;
return ret;
}
void freeTree(Tree * tree) {
TreeIterator * iter = newTreeIterator(tree, POSTORDER);
TreeNode * node;
if(data->freeFunc) {
void * data;
while( ( data = nextTreeIterator(iter) ) ) {
}
freeTreeIterator(iter);
iter = newTreeIterator(tree, POSTORDER);
}
while( ( node = nextNodeTreeIterator(iter) ) ) {
freeTreeNode(node);
}
freeTreeIterator(iter);
}
|
