#include <iostream>
#include "bst.h"
#include "binaryWords.h"
#include <fstream>
#include<cstring>
#include<cassert>

using namespace::std;

//traversal
void inOrderTraversal(BST<Word>* v)
{
	if (!v->isEmpty())
	{
		inOrderTraversal(v->left());
		cout<<v->getData() << '\t';
		inOrderTraversal(v->right());
	}
}




void main(void)
{
// typedef is common approach to code simplification
// lets one think about an integer BSt and integer BST pointer rather than the more complex syntax
 
Word v[200];


ifstream ifile("treetext.txt") ;
   assert(ifile) ;


   for(int wcount = 0 ; !ifile.eof() ; wcount++)
      ifile >> v[wcount] ;

// print output of all ints - correct count for 1 too many
   for(int i = 0 ; i < wcount - 1 ; i++)
      cout << v[i]<<" ";
   cout << endl << endl ;   // spacer

typedef    BST<Word>   WordBST ;
typedef    WordBST *    WordBSTPtr ;
 
WordBSTPtr   b(new WordBST) ;       // create a BST to receive data
 

cout<<"We are now loading the tree and traversing it to make sure its loaded: "<<endl;

for(int x=0; x<wcount; x++)
{
	b->Insert(v[x]);
}

cout << endl;
inOrderTraversal(b);
cout << endl;


Word Test("seeing");
cout<<"Testing the first word"<< Test.getText()<<endl;
// Question : is seeing in the tree ?
BST<Word>*getWord = WordBST.retrieve(Test);  // Error  C2275 is located here
   
   if(getWord->isEmpty( ))
     cout << " seeing NOT FOUND" << endl ;
   else
      cout << " seeing FOUND" << endl ;
}

Word Test("seeing");
cout<<"Testing the first word "<< Test.getText()<<endl;
// Question : is seeing in the tree ?
WordBSTPtr getWord(b->retrieve(Test));
   
   if(getWord->isEmpty( ))
     cout << " seeing NOT FOUND" << endl ;
   else
      cout << " seeing FOUND" << endl ;

function() {
  // actions
  if (!something()) {
      goto cleanup;
  if (!something_else())
      goto cleanup;
  // and so on
cleanup:
  // do some cleanup
}