#include <iostream>
#include "bintree2.h"

template <class Item> 
void bstInsert(BinaryTreeNode<Item>*& root, const Item& entry)
{






}

template <class Item> 
bool bstSearch(BinaryTreeNode<Item>*& root, const Item& target)
{






}

template <class Item> 
void bstRemove(BinaryTreeNode<Item>*& root, const Item& target)
{














}






void main()
{
   int in;
   BinaryTreeNode<int> *root=NULL;
   cout << "Enter numbers to insert, -1 when you are done: ";
   cin >> in;
   while (in > 0.0)
   {
      bstInsert(root, in);
      cin >> in;
   }
   print(root, 0);
   
   cout << "Enter numbers to search for, -1 when you are done: ";
   cin >> in;
   while (in > 0.0)
   {
      cout << in << ": ";
      bstSearch(root, in)? cout << "found\n" : cout << "not found\n";
      cin >> in;
   }

   cout << "Enter numbers to remove, -1 when you are done: ";
   cin >> in;
   while (in > 0.0)
   {
      bstRemove(root, in);
      cin >> in;
   }
   print(root, 0);

}