#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"

void PrintChar(char& item)
{
        cout << item << " ";
}

int
main(int argc, char argv[])
{
    
    // declare a tree of Word objects read from stream fin
    TreeNode<int> *one;
    TreeNode<int> *two;
    TreeNode<int> *three;
    TreeNode<int> *four;
    TreeNode<int> *five;
    TreeNode<int> *six;
    TreeNode<int> *seven;
    BinSTree<char> *someTree = new BinSTree<char>();

    one = new TreeNode<int> (10);
    two = new TreeNode<int> (20);
    three = new TreeNode<int> (35);
    four = new TreeNode<int> (50);
    five = new TreeNode<int> (15,one,two);
    six = new TreeNode<int> (40,three, four);
    seven = new TreeNode<int> (30,five,six);

    someTree->PrintTree(seven, 0);
    cout << endl;
    cout << endl;
    cout << endl;

    someTree->PrintVTree(seven,4,60);
    cout << endl;
    cout << endl;
    cout << endl;

    int count;
    someTree->CountLeaf(seven,count);
    cout << "counted " << count << " leaves" << endl;
    cout << endl;
   
    cout << "Depth of 40 is " << someTree->Depth(six) << endl;
    cout << endl;
 
}