fork download
copy 
  1. /************************************************************************/
  2. /*   Project:    Implementation Binary Seach Tree with templeates        */
  3. /*                Created by Gofur Halmuratov  1.04.2008                 */
  4. /************************************************************************/
  5. #include <iostream>
  6. #include <cstdlib>
  7. using namespace std;
  8. template<class T> 
  9. class BinarySearchTree
  10. {
  11. private:
  12. 	struct tree_node
  13. 	{
  14. 		tree_node* left;
  15. 		tree_node* right;
  16. 		T data;
  17. 	};
  18. 	tree_node* root;
  19. public:
  20. 	BinarySearchTree()
  21. 	{
  22. 		root = NULL;
  23. 	}
  24. 	bool isEmpty() const { return root==NULL; }
  25. 	void print_inorder();
  26. 	void inorder(tree_node*);
  27. 	void print_preorder();
  28. 	void preorder(tree_node*);
  29. 	void print_postorder();
  30. 	void postorder(tree_node*);
  31. 	void insert(T);
  32. 	void remove(T);
  33. 	bool search(T);
  34. };
  35.  
  36.  
  37. template <class T>
  38. void BinarySearchTree<T>::insert(T d)
  39. {
  40. 	tree_node* t = new tree_node;
  41. 	tree_node* parent;
  42. 	t->data = d;
  43. 	t->left = NULL;
  44. 	t->right = NULL;
  45. 	parent = NULL;
  46. 	// is this a new tree?
  47. 	if(isEmpty()) root = t;
  48. 	else
  49. 	{
  50. 		//Note: ALL insertions are as leaf nodes
  51. 		tree_node* curr;
  52. 		curr = root;
  53. 		// Find the Node's parent
  54. 		while(curr)
  55. 		{
  56. 			parent = curr;
  57. 			if(t->data > curr->data) curr = curr->right;
  58. 			else curr = curr->left;
  59. 		}
  60.  
  61. 		if(t->data < parent->data)
  62. 			parent->left = t;
  63. 		else
  64. 			parent->right = t;
  65. 	}
  66. }
  67. template <class T>
  68. bool BinarySearchTree<T>::search(T d)
  69. {
  70. 	//Locate the element
  71. 	bool found = false;
  72. 	if(isEmpty())
  73. 	{
  74. 		cout<<" This Tree is empty! "<<endl;
  75. 		return false;
  76. 	}
  77. 	tree_node* curr;
  78. 	tree_node* parent;
  79. 	curr = root;
  80. 	parent = (tree_node*)NULL;
  81. 	while(curr != NULL)
  82. 	{
  83. 		if(curr->data == d)
  84. 		{
  85. 			found = true;
  86. 			break;
  87. 		}
  88. 		else
  89. 		{
  90. 			parent = curr;
  91. 			if(d>curr->data) curr = curr->right;
  92. 			else curr = curr->left;
  93. 		}
  94. 	}
  95. 	if(!found)
  96. 	{
  97. 		cout<<" Data not found! "<<endl;
  98. 	}
  99. 	else
  100. 	{
  101. 		cout<<" Data found! "<<endl;
  102. 	}
  103.  
  104. 	return found;
  105. }
  106.  
  107. template <class T>
  108. void BinarySearchTree<T>::remove(T d)
  109. {
  110. 	bool found = false;
  111. 	if(isEmpty())
  112. 	{
  113. 		cout<<" This Tree is empty! "<<endl;
  114. 		return;
  115. 	}
  116. 	tree_node* curr;
  117. 	tree_node* parent;
  118. 	curr = root;
  119. 	parent = (tree_node*)NULL;
  120. 	while(curr != NULL)
  121. 	{
  122. 		if(curr->data == d)
  123. 		{
  124. 			found = true;
  125. 			break;
  126. 		}
  127. 		else
  128. 		{
  129. 			parent = curr;
  130. 			if(d>curr->data) curr = curr->right;
  131. 			else curr = curr->left;
  132. 		}
  133. 	}
  134. 	if(!found)
  135. 	{
  136. 		cout<<" Data not found! "<<endl;
  137. 		return;
  138. 	}
  139.  
  140. 	// Node with single child
  141. 	if((curr->left == NULL && curr->right != NULL)|| (curr->left != NULL
  142. 		&& curr->right == NULL))
  143. 	{
  144. 		if(curr->left == NULL && curr->right != NULL)
  145. 		{			
  146. 			if(parent->left == curr)
  147. 			{
  148. 				parent->left = curr->right;
  149. 				delete curr;
  150. 			}
  151. 			else
  152. 			{
  153. 				parent->right = curr->right;
  154. 				delete curr;
  155. 			}
  156. 		}
  157. 		else // left child present, no right child
  158. 		{
  159. 			if(parent->left == curr)
  160. 			{
  161. 				parent->left = curr->left;
  162. 				delete curr;
  163. 			}
  164. 			else
  165. 			{
  166. 				parent->right = curr->left;
  167. 				delete curr;
  168. 			}
  169. 		}
  170. 		return;
  171. 	}
  172.  
  173. 	//We're looking at a leaf node
  174. 	if( curr->left == NULL && curr->right == NULL)
  175. 	{
  176. 		if (parent == NULL)
  177. 		{
  178. 			delete curr;
  179.  
  180. 		} else
  181. 			if(parent->left == curr) parent->left = NULL;
  182. 			else parent->right = NULL;
  183. 			delete curr;
  184. 			return;
  185. 	}
  186.  
  187.  
  188. 	//Node with 2 children
  189. 	// replace node with smallest value in right subtree
  190. 	if (curr->left != NULL && curr->right != NULL)
  191. 	{
  192. 		tree_node* chkr;
  193. 		chkr = curr->right;
  194. 		if((chkr->left == NULL) && (chkr->right == NULL))
  195. 		{
  196. 			curr = chkr;
  197. 			delete chkr;
  198. 			curr->right = NULL;
  199. 		}
  200. 		else // right child has children
  201. 		{
  202. 			//if the node's right child has a left child
  203. 			// Move all the way down left to locate smallest element
  204.  
  205. 			if((curr->right)->left != NULL)
  206. 			{
  207. 				tree_node* lcurr;
  208. 				tree_node* lcurrp;
  209. 				lcurrp = curr->right;
  210. 				lcurr = (curr->right)->left;
  211. 				while(lcurr->left != NULL)
  212. 				{
  213. 					lcurrp = lcurr;
  214. 					lcurr = lcurr->left;
  215. 				}
  216. 				curr->data = lcurr->data;
  217. 				delete lcurr;
  218. 				lcurrp->left = NULL;
  219. 			}
  220. 			else
  221. 			{
  222. 				tree_node* tmp;
  223. 				tmp = curr->right;
  224. 				curr->data = tmp->data;
  225. 				curr->right = tmp->right;
  226. 				delete tmp;
  227. 			}
  228.  
  229. 		}
  230. 		return;
  231. 	}
  232.  
  233. }
  234. template<class T>
  235. void BinarySearchTree<T>::print_inorder()
  236. {
  237. 	inorder(root);
  238. }
  239. template<class T>
  240. void BinarySearchTree<T>::inorder(tree_node* p)
  241. {
  242. 	if(p != NULL)
  243. 	{
  244. 		if(p->left) inorder(p->left);
  245. 		cout<<" "<<p->data<<" ";
  246. 		if(p->right) inorder(p->right);
  247. 	}
  248. 	else return;
  249. }
  250. template<class T>
  251. void BinarySearchTree<T>::print_preorder()
  252. {
  253. 	preorder(root);
  254. }
  255. template<class T>
  256. void BinarySearchTree<T>::preorder(tree_node* p)
  257. {
  258. 	if(p != NULL)
  259. 	{
  260. 		cout<<" "<<p->data<<" ";
  261. 		if(p->left) preorder(p->left);
  262. 		if(p->right) preorder(p->right);
  263. 	}
  264. 	else return;
  265. }
  266. template<class T>
  267. void BinarySearchTree<T>::print_postorder()
  268. {
  269. 	postorder(root);
  270. }
  271.  
  272. template<class T>
  273. void BinarySearchTree<T>::postorder(tree_node* p)
  274. {
  275. 	if(p != NULL)
  276. 	{
  277. 		if(p->left) postorder(p->left);
  278. 		if(p->right) postorder(p->right);
  279. 		cout<<" "<<p->data<<" ";
  280. 	}
  281. 	else return;
  282. }
  283.  
  284. int main()
  285. {
  286. 	BinarySearchTree<int> b;
  287. 	int ch;
  288. 	int tmp,tmp1;
  289. 	while(1)
  290. 	{
  291. 		cout<<endl<<endl;
  292. 		cout<<" Binary Search Tree Operations "<<endl;
  293. 		cout<<" ----------------------------- "<<endl;
  294. 		cout<<" 1. Insertion/Creation "<<endl;
  295. 		cout<<" 2. In-Order Traversal "<<endl;
  296. 		cout<<" 3. Pre-Order Traversal "<<endl;
  297. 		cout<<" 4. Post-Order Traversal "<<endl;
  298. 		cout<<" 5. Removal "<<endl;
  299. 		cout<<" 6. Search "<<endl;
  300. 		cout<<" 7. Exit "<<endl;
  301. 		cout<<" Enter your choice : ";
  302. 		cin>>ch;
  303. 		switch(ch)
  304. 		{
  305. 		case 1 : cout<<" Enter data to be inserted : ";
  306. 			cin.ignore(1);
  307. 			cin>>tmp;
  308. 			b.insert(tmp);
  309. 			break;
  310. 		case 2 : cout<<endl;
  311. 			cout<<" In-Order Traversal "<<endl;
  312. 			cout<<" -------------------"<<endl;
  313. 			b.print_inorder();
  314. 			break;
  315. 		case 3 : cout<<endl;
  316. 			cout<<" Pre-Order Traversal "<<endl;
  317. 			cout<<" -------------------"<<endl;
  318. 			b.print_preorder();
  319. 			break;
  320. 		case 4 : cout<<endl;
  321. 			cout<<" Post-Order Traversal "<<endl;
  322. 			cout<<" --------------------"<<endl;
  323. 			b.print_postorder();
  324. 			break;
  325. 		case 5 : cout<<" Enter data to be deleted : ";
  326. 			cin.clear();
  327. 			cin.ignore(1);
  328. 			cin>>tmp1;
  329. 			b.remove(tmp1);
  330. 			break;
  331. 		case 6 : cout<<" Enter data to be searched : ";
  332. 			cin.ignore(1);
  333. 			cin>>tmp;
  334. 			b.search(tmp);
  335. 			break;
  336. 		case 7 : system("pause");                                                      
  337. 			return 0;
  338. 			break;
  339. 		}
  340. 	}
  341. }
  342.  
Runtime error #stdin #stdout 0s 16072KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pre-Order Traversal 
 4. Post-Order Traversal 
 5. Removal 
 6. Search 
 7. Exit 
 Enter your choice : 

 Binary Search Tree Operations 
 ----------------------------- 
 1. Insertion/Creation 
 2. In-Order Traversal 
 3. Pr
https://ideone.com/aobN7S
language:
C++ (gcc 8.3)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!