#include #include #include using namespace std; //Read before run /*just create a txt file with name of binary like binary.txt and insert some words with meaning line wise 1st word then in 2nd line its meaning */ struct Treenode{ string key; string mean; int height; Treenode *left; Treenode *right; }; //******************Functions Prototypes******************** void insertingintoTree(); Treenode* insert(Treenode * p,string element,string b); void search(Treenode *temp,string value); void insertintofile(); void inserting_into_file(string word,string meaning,Treenode*temp); void Update(); int height(Treenode *p); int max(int a, int b); Treenode* rightRotate(Treenode* p); Treenode* leftRotate(Treenode* p); int getBalance(Treenode *p); void inorder(Treenode *p); void deleteword(); void Deleting_into_file(string word,Treenode*temp); Treenode *root=NULL; void insertingintoTree()//Inserting words from file into tree { string a,b; ifstream key; key.open("binary.txt",ios::in); while(!key.eof()) { getline(key,a); getline(key,b); root=insert(root,a,b); } key.close( ); } int max(int a, int b) // gets the max of two integers { if(a > b) return a; else return b; } int height(Treenode *p) // avl gets the height of the tree { if(p == NULL) return -1; else { p->height = max(height(p->left), height(p->right)) + 1; } return p->height; } Treenode* rightRotate(Treenode* p) // function to right rotate a tree rooted at p { Treenode* child = p->left; // rotate the tree p->left = child->right; child->right = p; // update the height for the nodes p->height = height(p); child->height = height(child); // return new root return child; }// function to left rotate a tree rooted at p Treenode* leftRotate(Treenode* p) { Treenode* child = p->right; // perform the rotation p->right = child->left; child->left = p; // update the heights for the nodes p->height = height(p); child->height = height(child); // return new root return child; } int getBalance(Treenode *p) { if(p == NULL) return 0; else return height(p->left) - height(p->right); }// inerting object and return a new node with empty subtrees Treenode* newNode(string element,string b) { Treenode *obj=new Treenode; obj->key=element; obj->mean=b; obj->left=NULL; obj->right=NULL; return obj; } Treenode* insert(Treenode * p,string element,string b) { if(p == NULL) // if the tree is empty { return(newNode(element,b)); } /*Avl tree implementing*/ if(element < p->key) { p->left = insert(p->left, element,b); } else { p->right = insert(p->right,element,b); } // update the height for this node p->height = height(p); // get the balance factor to see if the tree is unbalanced int balance = getBalance(p); // the tree is unbalanced, there are 4 different types of rotn // Single Right Rotation (Left Left Case) if(balance > 1 && element < p->left->key) { return rightRotate(p); } // Single Left Rotation (Right Right Case) if(balance < -1 && element > p->right->key) { return leftRotate(p); } // Left Right Rotation (double left rotation) if(balance > 1 && element > p->left->key) { p->left = leftRotate(p->left); return rightRotate(p); } // Right Left Rotation if(balance < -1 && element < p->right->key) { p->right = rightRotate(p->right); return leftRotate(p); } return p; } void search(Treenode *temp,string value) { if(temp==NULL) return; else { if(temp->key==value) { cout<<"\t\t\t"<key<<"= "; cout<mean<<"\n \n"; return; } else{ search(temp->left,value); search(temp->right,value); } } } void insertintofile() { root=NULL; string word,meaning; cout<<"Enter Word : "; cin>>word; cout<<"Enter Meaning : "; cin>>meaning; ofstream myfile; myfile.open("binary.txt",ios::app); Treenode *obj=new Treenode; obj->key=word; obj->mean=meaning; obj->left=NULL; obj->right=NULL; if(root ==NULL) { root=obj; myfile<key) { myfile<left); inserting_into_file(word,meaning,temp->right); } else { myfile<key<mean<left); inserting_into_file(word,meaning,temp->right); } } myfile.close(); } void Deleting_into_file(string word,Treenode*temp) { ofstream myfile; myfile.open("binary.txt",ios::out|ios::app); if(temp) { if(word==temp->key) { myfile<<" "<left); Deleting_into_file(word,temp->right); } else { myfile<key<mean<left); Deleting_into_file(word,temp->right); } } myfile.close(); } void Update() { string word,meaning; root=NULL; insertingintoTree(); cout<<"Enter Word For Update: "; cin>>word; cout<<"Enter Meaning For Update: "; cin>>meaning; ofstream myfile; myfile.open("binary.txt",ios::out|ios::trunc); myfile.close(); inserting_into_file(word,meaning,root); } void deleteword() { string word,meaning; insertingintoTree(); cout<<"Enter Word For Delete: "; cin>>word; ofstream myfile; myfile.open("binary.txt",ios::out|ios::trunc); myfile.close(); Deleting_into_file(word,root); } void inorder(Treenode *p) { if(p != NULL) { inorder(p->left); cout << p->key << " = "<mean<right); } } int main() { int a,b; cout<<"\t 1 For Meaning \n\t 2 For Update in File \n\t 3 Insert a new Word \n\t 4 Delete a Word \n\t 5 for Terminate\n"; Loop:cout<<"Press number for operation performed : "; cin>>a; if(a==5) goto stop; if(a==1){ string search1; cout<<"Enter word for search : "; cin>>search1; root=NULL; insertingintoTree(); search(root,search1); } if(a==2) { Update(); cout<<"Your Word Has been Updated : "<

Dicitionary using avl tree in C++