Study the scenario and complete the questions that follow:

A Map Application for Cartographers: Searching Part I

Development of the application is underway. There are still a few more design decisions the cartographers

heed your help on$.$

The cartographers want to have a method of searching for places in their database. You tell them that a

possible method is a binary search tree. The cartographers are eager to proceed with the development of

their application and ask you to implement a binary search tree. They also want to see the performance of

this search function. Devise another test for binary search tree. You are required to:

Create a program called DemoBinarySearchTree.cs that will populate a binary search tree with a list of

names from the places.txt file. The search tree should be able to search for a name, insert a name, and

delete a name. You must use system time to obtain the runtime of the search, insertion and deletion

functions. Your program should prompt the user for the location of the input file.

Choose any $10$ names from the list. Search for these names using the binary search tree and record the

runtimes. Then delete these $10$ names from data structures and record the deletion runtimes. Next insert

the following names into both data structures: Delhi, Mumbai, Kolkata, Chennai, Bengaluru, Hyderabad,

Pune, Ahmedabad, Jaipur, Chandigarh and record the insertion runtimes. You should have $30$ runtimes

in total.

Plot the runtimes of the search, insert and delete functions of the program onto $3$ box and whisker

diagrams.

In a paragraph of about $4$ lines, discuss your findings. Also discuss ways of improving the Binary search

tree.