- Binary Search Tree Bst Modify The Following Intbinarytree Class To Store The Data Of Persons Provided In A Text File 1 (138.36 KiB) Viewed 53 times
Binary Search Tree - BST Modify the following intBinaryTree class to store the data of Persons provided in a text file. The same information was used in the Assig01 to create a link list. Now with BST, all the operations especially searching gets quite efficient, as trees are good at this as compared to the link list. . The person's data provided in the text file contains the following information First Name (string) Last Name (string) Telephone (string) email (string) . . Either make a structure or a class to store the information of a person. The provided text file contains the information for 500 persons. One line contains information of a single person and every information in the line is separated with a tab from the other information. Your program should read the provided data file at the start containing Persons data, store the data in the BST and then present the following menu. The menu shown should be: . . Find and show person's data given its email (10 marks) Append new Person entered by user (10 marks) Delete the data of a Person given its email (10 marks) Show the data of all Persons (10 marks) Exit . . Upon exit, overwrite the provided text file with the current data of the link list, so that the text file has the updated data. (10 marks) class IntBinaryTree { private: struct TreeNode{ int value; TreeNode *left; TreeNode *right; }; TreeNode *root; void tree_clear (TreeNode *&); void deleteNode (int, TreeNode *&); void makeDeletion (TreeNode *&); void display InOrder (TreeNode *); public: IntBinaryTree () // Constructor { root = NULL; } IntBinaryTree () // Destructor { tree_clear (root); } void insertNode (int); bool searchNode (int); void remove (int); void showNodes InOrder (void) { display InOrder (root); } };