Write a menu-driven program that will demonstrate the use of Binary Search Trees. The key field in each node is to be a two-character string.
Your program should start with an empty BST. The user should be given the following options:
1) Build a tree from a data file. The data file is to contain key values, one per line, in the order in which they are to be inserted into the tree. Note that this does NOT necessarily mean that they are in order by key values.
NOTE: you must show the tree at each stage of its “growth”. The user should press a key each time he/she wants to move to the next step.
2) Insert a specified key into the tree.
3) Delete a specified key from the tree.
4) “Access” (search for) a specified key.
5) “Clear” the tree. That is, reset to an empty tree.
You must display the tree after each step. Have the user press a key to return to the menu. Your program mustbe able to properly display trees of heights up to 4(5 levels).Note that this display can be in a simple text-based form, but it must reflect the visual structure of the tree. That is, something similar to what you have been seeing in the online notes will be sufficient.
You must use a dynamic (pointer-based) tree structure in this project.
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of