(btree)+struct for binary tree

Has a custom enum for ordering, as each type of data may have its own
comparator system.  Hence, each node will have a comparison function
pointer internally.  Though this increases the data required to create
a binary tree, it does make it easier to support multiple types.

1 files changed, 20 insertions, 0 deletions

diff --git a/btree.cpp b/btree.cpp
index e5d412c..c22c297 100644
--- a/btree.cpp
+++ b/btree.cpp
@@ -4,3 +4,23 @@
  */
 
 
+enum Order
+{
+  LT,
+  GT,
+  EQ
+};
+
+template <typename T>
+struct BinaryTree
+{
+  T value;
+  BinaryTree<T> *left, *right;
+  enum Order (*compare)(T, T);
+  ~BinaryTree()
+  {
+    delete left;
+    delete right;
+  }
+};
+