#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<char> *one;
    TreeNode<char> *two;
    TreeNode<char> *three;
    TreeNode<char> *four;
    TreeNode<char> *five;
    TreeNode<char> *six;
    TreeNode<char> *seven;

    one = new TreeNode<char> ('a');
    two = new TreeNode<char> ('d');
    three = new TreeNode<char> ('f');
    four = new TreeNode<char> ('h');
    five = new TreeNode<char> ('b',one,two);
    six = new TreeNode<char> ('g',three, four);
    seven = new TreeNode<char> ('e',five,six);

    cout << endl;
    cout << endl;

    Inorder(seven,PrintChar);
    cout << endl;
    cout << endl;

    Preorder(seven,PrintChar);
    cout << endl;
    cout << endl;

    Postorder(seven,PrintChar);
    cout << endl;
    cout << endl;
 
    LevelScan(seven,PrintChar);
    cout << endl;
    cout << endl;
 
}