#include<iostream>

#include <string>
#include <stdlib.h>
#include<dos.h>
#include<fstream>
using namespace std;
class node
{
public:
string word;
string mean;
node *left;
node *right;
node()
{
}
};
class tree
{
private:
node *root;
public:
tree()
{
root = NULL;
}
node* getnode()
{
ofstream file;
file.open("btree.dat",ios::app);
node *newnode=new node();
cout << "ENTER THE WORD: ";
cin >> newnode->word;
cout << "ENTER ITS MEANING: ";
cin >> newnode->mean;
if (file.is_open())
{
file << "\n" << newnode->word << "\n" << newnode->mean << "\n";
}
else
{
cout << "FIle is not open succesfully\n";
}
newnode->left = NULL;
newnode->right = NULL;
file.close();
return(newnode);
}
void insert()
{
if (root == NULL)
{
root=getnode();
}
else
{
node *temp;
node *current;
 node *parent=NULL;
current = root;
temp = getnode();
while (current)
{
parent = current;
if (current->word < temp->word)
{
current = current->right;
}
else
{
current = current->left;
}
}
if (temp->word > parent->word)
{
parent->right = temp;
}
else if(temp->word < parent->word)
{
parent->left = temp;
}
else
{
cout << "IT HAS BEEN ADDED ALREADY";
}
cout << temp->word << endl << temp->mean;
}
}
};