blob: deb420bc8b23dd584e64893c58893c919a9174e8 (
plain)
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
|
#ifndef TREE_H
#define TREE_H
typedef struct _TreeNode {
void * data[2];
struct _TreeNode * children[3];
struct _TreeNode * parent;
} TreeNode;
typedef struct _Tree {
TreeNode headNode;
TreeFreeDataFunc * freeFunc;
TreeCompareDataFunc * compareFunc;
} Tree;
typedef enum _TreeIteratorType {
PREORDER,
INORDER,
POSTORDER
} TreeIteratorType;
typedef struct _TreeIterator {
Data * data;
/* private data */
TreeIteratorType type;
TreeNode * currentNode;
int pos;
} TreeIterator;
typedef int TreeCompareDataFunc(void * left, void * right);
typedef int TreeFreeDataFunc(void * data);
Tree * newTree(TreeFreeDataFunc * freeFunc, TreeCompareDataFunc * compareFunc);
void freeTree(Tree * tree);
int insertInTree(Tree * tree, void * data);
int deleteFromTree(Tree * tree, void * needle);
void * findInTree(Tree * tree, void * needle);
TreeIterator * newTreeIterator(Tree * tree, TreeIteratorType type);
/* will return the same pointer passed in on success
* if NULL is returned, this indicates the end of tree
*/
TreeIterator * nextTreeIterator(TreeIterator * iter);
#endif // TREE_H
|
