Dictionary which stores keywords and Meanings Program using Binary Search Tree

Problem Statement:

A Dictionary stores keywords & its meanings. Provide facility for adding new keywords, deleting keywords, updating values of any entry. Provide facility to display whole data sorted in ascending/ Descending order. Also find how many maximum comparisons may require for finding any keyword. Use Binary Search Tree for implementation.

Code:

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182

//============================================================================ // Name : DictionaryBST.cpp // Author : VNKDJ5 //============================================================================ #include <iostream> #include<string> using namespace std; class dictionary; class node { string word,meaning; node *left,*right; public: friend class dictionary; node() { left=NULL; right=NULL; } node(string word, string meaning) { this->word=word; this->meaning=meaning; left=NULL; right=NULL; } }; class dictionary { node *root; public: dictionary() { root=NULL; } void create(); void inorder_rec(node *rnode); void postorder_rec(node *rnode); void inorder() { inorder_rec(root); } void postorder(); bool insert(string word,string meaning); int search(string key); }; int dictionary::search(string key) { node *tmp=root; int count; if(tmp==NULL) { return -1; } if(root->word==key) return 1; while(tmp!=NULL) { if((tmp->word)>key) { tmp=tmp->left; count++; } else if((tmp->word)<key) { tmp=tmp->right; count++; } else if(tmp->word==key) { return ++count; } } return -1; } void dictionary::postorder() { postorder_rec(root); } void dictionary::postorder_rec(node *rnode) { if(rnode) { postorder_rec(rnode->right); cout<<" "<<rnode->word<<" : "<<rnode->meaning<<endl; postorder_rec(rnode->left); } } void dictionary::create() { int n; string wordI,meaningI; cout<<"\nHow many Word to insert?:\n"; cin>>n; for(int i=0;i<n;i++) { cout<<"\nENter Word: "; cin>>wordI; cout<<"\nEnter Meaning: "; cin>>meaningI; insert(wordI,meaningI); } } void dictionary::inorder_rec(node *rnode) { if(rnode) { inorder_rec(rnode->left); cout<<" "<<rnode->word<<" : "<<rnode->meaning<<endl; inorder_rec(rnode->right); } } bool dictionary::insert(string word, string meaning) { node *p=new node(word, meaning); if(root==NULL) { root=p; return true; } node *cur=root; node *par=root; while(cur!=NULL) //traversal { if(word>cur->word) {par=cur; cur=cur->right; } else if(word<cur->word) { par=cur; cur=cur->left; } else { cout<<"\nWord is already in the dictionary."; return false; } } if(word>par->word) //insertion of node { par->right=p; return true; } else { par->left=p; return true; } } int main() { string word; dictionary months; months.create(); cout<<"Ascending order\n"; months.inorder(); cout<<"\nDescending order:\n"; months.postorder(); cout<<"\nEnter word to search: "; cin>>word; int comparisons=months.search(word); if(comparisons==-1) { cout<<"\nNot found word"; } else { cout<<"\n "<<word<<" found in "<<comparisons<<" comparisons"; } return 0; }

Output:-