[Solved] CS240 Introduction to Computing III mp06 (Binary Search Tree)

Project setup

Create the project mp06.<FirstLast>. Replace FirstLast with your name and do not include the <> brackets. For instance, mp06.SocratisTornaritis.

Add the provided files to your project:

main.cpp

The folder mp06.Firstlast containing just the source file(s) and text file(s), is the one that you must zip and upload. Do not upload any IDE specific files.

Refer to the appropriate how to tutorial notes available on the course website, for instructions on how to create a project and manage its files.

Problem description:

You have been provided with all the source files and a text file for you to use. This time you are going to use the binary search tree class to create seven index trees for the states object. This assignment is the same as mp04, only this time you are using a bst object as an index into the linked list of State objects.

The state data will be loaded from the file and stored inside a linked list. Seven index bst objects will then function as indices into the data, one per field, just like last time. You will have to complete the implementation of some of the methods in these classes.

Program requirements:

• Implement all the TODO methods in the states.cpp fileRefer to the imbedded comments for details.
• Implement the display() method in the states.h fileRefer to the imbedded comments for details.

As you write your programs from here on out, documentation will be desirable and an essential part of your code. Add the following section to each of your programs to identify relevant information to anyone reading your code. The sample below is what I used for Main.java, so make the appropriate changes to reflect your current/accurate information. This is just a sample, so feel free to add to it if you want, but do not remove anything.

/* File: <filename>

• Name: <your name>
• Revised: <date authored>
• Course: CS240 Introduction to Computing III

*

• Desc: <program description>

*/