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
|
/*@@
@header BinaryTree.h
@date Mon Oct 5 11:01:20 1998
@author Tom Goodale
@desc
Prototypes and data definitions for binary tree routines.
@enddesc
@version $Header$
@@*/
#ifndef _SKBINTREE_H_
#define _SKBINTREE_H_
typedef struct T_SKTREE
{
struct T_SKTREE *left;
struct T_SKTREE *right;
struct T_SKTREE *next;
struct T_SKTREE *last;
char *key;
void *data;
} t_sktree;
#ifdef __cplusplus
extern "C" {
#endif
t_sktree *SKTreeStoreData(t_sktree *root,
t_sktree *subtree,
const char *key,
void *data);
int SKTreeTraverseInorder(t_sktree *root, int (*process)(const char *,void *, void *), void *info);
int SKTreeTraversePreorder(t_sktree *root, int (*process)(const char *,void *, void *), void *info);
int SKTreeTraversePostorder(t_sktree *root, int (*process)(const char *,void *, void *), void *info);
void SKTreePrintNodes(t_sktree *root, int depth, void (*print_node)(const char *,void *, int));
t_sktree *SKTreeFindNode(t_sktree *root, const char *key);
t_sktree *SKTreeFindFirst(t_sktree *root);
void SKTreeDebugNodes(t_sktree *root, int depth);
#ifdef __cplusplus
}
#endif
#endif
|
