// File: TreeTest.cpp
// Driver for Binary Tree ADT

#include <iostream.h>
#include <string.h>
#include "Tree_ADT.h"
#include "Char_ops.h"

#pragma option -Jgx

typedef BinaryTree<int> BinTree;

void main()
{BinTree Tree;
 int Entry,*Result;
 char Choice;
 do {
  cout << "Select: A)dd Element   R)emove Element    P)rint    Q)uit\n";
  Choice=GetChoice("ARPQ");
  switch (Choice) {
   case 'A':
    cout << " Enter an Integer >";
    cin >> Entry;
    Tree.InsertToTree(Entry);
    break;
   case 'P':
    cout << "The Tree:" << endl;
    Tree.Inorder();
    break;
   case 'R':
    cout << "Value to Delete? >";
    cin >> Entry;
    Result=Tree.TreeSearch(Entry);
    if (!Result) cout << Entry << " Not Found\n";
    else Tree.DeleteFromTree(Entry);
  }
 } while (Choice!='Q');
}