summaryrefslogtreecommitdiff
path: root/src/util/BinaryTree.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/util/BinaryTree.h')
-rw-r--r--src/util/BinaryTree.h44
1 files changed, 0 insertions, 44 deletions
diff --git a/src/util/BinaryTree.h b/src/util/BinaryTree.h
deleted file mode 100644
index 07356f3f..00000000
--- a/src/util/BinaryTree.h
+++ /dev/null
@@ -1,44 +0,0 @@
- /*@@
- @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 _BINARYTREE_H_
-#define _BINARYTREE_H_
-
-#ifdef _cplusplus
-extern "C" {
-#endif
-
-typedef struct T_TREE
-{
- struct T_TREE *left;
- struct T_TREE *right;
- struct T_TREE *next;
-
- void *data;
-} t_tree;
-
-
-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