Question: implement only in c++ language You are to implement a phone dictionary using Binary Search Tree (BST). A dictionary is composed of numbers of contacts.
You are to implement a phone dictionary using Binary Search Tree (BST). A dictionary is composed of numbers of contacts. Each contact will have name, phone number and Id. Your task is to add/edit/remove contacts in BST. Every contact is searchable based on name and phone number. A function to determine whether give tree is BST. Functions for inorder/preorder/postorder traversals. Create duplicate of BST Save every record to a file (Bonus points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
