#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[])
{
    
    // declare a tree of Word objects read from stream fin
    TreeNode<char> *one;
    TreeNode<char> *two;
    TreeNode<char> *three;
    BinSTree<char> *someTree = new BinSTree<char>();

    cout << "Tree One " << endl;
    one = new TreeNode<char> ('a');
    someTree->PrintVTree(one, 2, 60);
    cout << endl;
    cout << endl;

    cout << "Tree Two " << endl;
    two = new TreeNode<char> ('b',one);
    someTree->PrintVTree(two, 2, 60);
    cout << endl;
    cout << endl;

    cout << "Tree Three " << endl;
    three = new TreeNode<char> ('c',one,two);
    someTree->PrintVTree(three, 2, 60);
    cout << endl;
    cout << endl;
 
}