1 /* $NetBSD: twalk.c,v 1.2 1999/09/16 11:45:37 lukem Exp $ */
4 * Tree search generalized from Knuth (6.2.2) Algorithm T just like
5 * the AT&T man page says.
7 * The node_t structure is for internal use only, lint doesn't grok it.
9 * Written by reading the System V Interface Definition, not the code.
11 * Totally public domain.
14 #define _SEARCH_PRIVATE
23 static void trecurse (const node_t *,
24 void (*action)(const void *, VISIT, int), int level);
26 /* Walk the nodes of a tree */
28 trecurse(root, action, level)
29 const node_t *root; /* Root of the tree to be walked */
30 void (*action) (const void *, VISIT, int);
34 assert(action != NULL);
36 if (root->llink == NULL && root->rlink == NULL)
37 (*action)(root, leaf, level);
39 (*action)(root, preorder, level);
40 if (root->llink != NULL)
41 trecurse(root->llink, action, level + 1);
42 (*action)(root, postorder, level);
43 if (root->rlink != NULL)
44 trecurse(root->rlink, action, level + 1);
45 (*action)(root, endorder, level);
49 /* Walk the nodes of a tree */
52 const void *vroot; /* Root of the tree to be walked */
53 void (*action) (const void *, VISIT, int);
55 if (vroot != NULL && action != NULL)
56 trecurse(vroot, action, 0);