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
|
/*@@
@header BinaryTree.h
@date Mon Oct 5 11:01:20 1998
@author Tom Goodale
@desc
Prototypes and data definitions for binary tree routines.
@enddesc
@@*/
#ifndef _BINARYTREE_H_
#define _BINARYTREE_H_
typedef struct T_TREE
{
struct T_TREE *left;
struct T_TREE *right;
struct T_TREE *next;
void *data;
} t_tree;
#ifdef _cplusplus
extern "C" {
#endif
t_tree *TreeStoreData(t_tree *root, t_tree *subtree, void *data, int (*compare)(const void *, const void *));
int TreeTraverseInorder(t_tree *root, int (*process)(void *, void *), void *info);
int TreeTraversePreorder(t_tree *root, int (*process)(void *, void *), void *info);
int TreeTraversePostorder(t_tree *root, int (*process)(void *, void *), void *info);
void TreePrintNodes(t_tree *root, int depth, void (*print_node)(void *, int));
t_tree *TreeFindNode(t_tree *root, void *data, int (*compare)(const void *, const void *));
#ifdef _cplusplus
}
#endif
#endif
|
