#include <string>
#include <iostream>
#include <fstream>
 
using namespace std;
 
struct mytree
{
	string item;
	mytree* left;
	mytree* right;
	int frequency;
};
 
class TreeofWords 
{
private:
	mytree *start;
 
public:
	TreeofWords();
	void inserted(string aword);
	void print();
	int Frequency(string freakword);
};
void main()
{
ifstream file;
string filename;
string word;
TreeofWords display;
 
cout<<"Enter file name.\n";
cin>>filename;
 
file.open(filename.c_str());
 
while(!file)
{
cout << "Unable to open file. Enter a different name: ";
file.clear();
cin >> filename;
file.open(filename.c_str());
}
while(file>>word)
{
cout<<display.Frequency(word);
display.inserted(word);
}
 
display.print();
 
}
 
TreeofWords::TreeofWords()
{
	start=NULL;
}
 
void insert(mytree*& start, string aword)
{
	if(start == NULL)
	{
		start = new mytree;
		start->right = NULL;
		start->left = NULL;
		start->item = aword;
	}
	else if(aword < start->item)
		insert(start->left, aword);
	else
		insert(start->right, aword);
}
 
void TreeofWords::inserted(string aword)
{
	insert(start, aword);
}
void printme(mytree*& start)
{
	if(start != NULL)
	{
		printme(start->left);
		cout<<start->item<<endl;
		printme(start->right);	
	}
}
 
void TreeofWords::print()
{
	printme(start);
}
int searchFrequency(mytree *start, string freakword)
{
   if(start == NULL)
   {
	   return 0;
   }
   else if(start->item<freakword)
   {
	   searchFrequency(start->left, freakword);
   }
   else if(start->item>freakword)
   {
	   searchFrequency(start->right, freakword);
   }
   else(start->item==freakword);
		return 1;
 
}
int TreeofWords::Frequency(string freakword)
{
	return searchFrequency(start, freakword);
}

void insert(mytree*& start, string aword)
{
	if(start == NULL)
	{
		start = new mytree;
		start->right = NULL;
		start->left = NULL;
		start->item = aword;
	}
	else if(aword < start->item)
		insert(start->left, aword);
	else
		insert(start->right, aword);
}

class node
{
    // data members below
     node* right;
     node* left;
     string word;
     int frequency;
 
     // one member function below
     insert (string aword)
     {
          // check whether word is the same as aword
          // if so, increment frequency, don't create new node.
          // if not, check whether to go right or left and if
          // child is null, create a new node.  Otherwise, 
          // recurse as you do.
     }
 
     // more member functions/constructor
};

class tree
{
     // data member
     node* top;
 
     // constructor 
     tree ()
     {
          top = NULL;
     }
 
     void insert (string aword)
     {
           if (top == NULL)
                // create new top node with call to node constructor
           else
                top->insert (aword);
     }
};

// member of TreeofWords
static int size=0;
void TreeofWords::setsize()
{
   size++;
}
int TreeofWords::getsize()
{return size;}
 
void main()
{
   // ...
   while(file>>word)
   {
      display.setsize();
      // ...
   }
   std::cout<<"freak word count : "<<display.getsize();
   // ...
}// done