/* btree.cpp
 * Date: 2021-11-22
 * Author: Aryadev Chavali
 */


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;
  }
};