From 4c72b3960e03381b9d244a3a452428d061e79249 Mon Sep 17 00:00:00 2001
From: allen <allen@17b73243-c579-4c4c-a9d2-2d5706c11dac>
Date: Thu, 3 Feb 2000 12:27:03 +0000
Subject: Moved to include directory

git-svn-id: http://svn.cactuscode.org/flesh/trunk@1348 17b73243-c579-4c4c-a9d2-2d5706c11dac
---
 src/util/BinaryTree.h | 44 --------------------------------------------
 1 file changed, 44 deletions(-)
 delete mode 100644 src/util/BinaryTree.h

(limited to 'src/util')

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
-- 
cgit v1.2.3