#include <iostream>
using namespace std;

#include "bitree.h"

int main()
{
    int val;
    node * root;
    cout<<"value of root?"<<endl;
    cin>>val;
    root = new node(val);
    char cont = 'y';
    while(cont !='n')
               {
                cout<<"add another node?"<<endl;
                cin>>cont;      
                if(cont!='n')
                     {
                     cout<<"new value?"<<endl;
                     cin>>val;         
                     root->addval(val);
                     }
                cout<<"---------contents"<<endl;
                root->print();
                cout<<"------------------"<<endl;
                
                
               }
    
    system("pause");
    return 0;   
}