template <class Key, class Item>

bool BSTDictionary<Key, Item>::recinsert(Key& key, Item& item, Kid* pointer)
{

Key* pkey;
Item* pitem;

if(pointer == NULL)
{

cout<<"root is null"<<endl;
root = new  Kid();

pkey = new Key(key);
pitem = new Item(item);

root->item = pitem;
root->key = pkey;

cout<<"Root values " + *root->key+ "  " + *root->item <<endl;
}

else if(key < *root->key){
cout<<"inserting to left of pointer"<<endl;
recinsert(key, item, root->left);
}

else if(key > *root->key){
cout<<"inserting to right of pointer"<<endl;
recinsert(key, item, root->right);
}


return true;

}

template <class Key, class Item>
bool BSTDictionary<Key, Item>::insert(Key& key, Item& item)
{

recinsert(key, item, root);


 return true;
}

#include "AbsDictionary.h"

template <class Key, class Item>
class BSTDictionary : public virtual AbsDictionary<Key, Item>
{
   public:


      BSTDictionary();

      BSTDictionary(bool v);

      bool insert(Key& key, Item& item);

//    Item* find(Key& key);

//    void remove(Key& key);

//    void removeAll(Key&);

//    ~BSTDictionary();

protected:

        class Kid
        {

        public:
        ~Kid()
        {
        delete key;
        delete item;
        }

  Key* key;
       Item* item;
       Kid* right;
       Kid* left;

    };