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

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

using namespace std;

typedef BinaryTree<int> BinTree;

char getChoice(string ok);

int main()
{BinTree Tree;
 int entry,*result;
 char Choice;
 do {
  cout << "Select: A)dd    R)emove     P)rint     T)ree Print     Q)uit\n";
  Choice=getChoice("ARPTQ");
  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);
    break;
   case 'T':
    cout << "The tree, as it appears (sort of)..\n";
    Tree.treePrint(); 
  }
 } while (Choice!='Q');
}

char getChoice(string ok)
{char ch=' ';
 do ch=toupper(cin.get()); while (ok.find(ch)==string::npos);
 cin.get(); // eat CR
 return(toupper(ch));
}