#include <iostream.h>
#include <fstream.h>
#include <stdlib.h>

#include "bstree.h"          // include  BinSTree class
#include "treeprnt.h"        // for Inorder scan
#include "treescan.h"       
#include "strclass.h"
#include "node.h"
#include "treelib.h"
#include "stack.h"

int
main(int argc, char argv[])
{
	BinSTree<int>  mySTree;
	
	mySTree.Insert(16);
	mySTree.Insert(10);
	mySTree.Insert(5);
	mySTree.Insert(15);
	mySTree.Insert(20);
	mySTree.Insert(12);
	mySTree.Insert(17);
	mySTree.Insert(14);
	mySTree.Insert(17);
	mySTree.Insert(12);
	mySTree.Insert(25);
	mySTree.Insert(22);
	mySTree.Insert(28);

	cout << "mySTree after inserting " << endl;
	mySTree.PrintVTree(mySTree.GetRoot(),5,60);
        cout << endl << endl;
	
        BinSTree<int> *myOTree = new BinSTree<int> (mySTree);

	cout << "myOTree after calling copy constructor " << endl;
	myOTree->PrintVTree(myOTree->GetRoot(),5,60);
        cout << endl << endl;


        BinSTree<int>  myPTree = mySTree;
	cout << "myPTree after using = operator " << endl;
	myPTree.PrintVTree(myPTree.GetRoot(),5,60);
        cout << endl << endl;

	 
}