C++ homework project

I have the site header files too. It should work exacutly as described. LOWEST BIT WILL GET THE JOB. I'm attaching the [login to view URL] file, PLEASE review for full description. Your project should contain the following files: [login to view URL] - program driver, contains the main(), menu(), pause() functions BST.h - Binary Search Tree header [login to view URL] - Binary Search Tree implementation BSTNode.h - Binary Search Tree Node header [login to view URL] - Binary Search Tree Node implementation City.h - City class header [login to view URL] - City class implementation (only contains constructors) The objective of this project is to implement Binary Search Tree ADT. You need to implement pointer based tree node class, where the key has a string value and each node contains information on some city. Your program should be interactive and menu driven. Here are steps that your program should perform: 1. Declare a binary search tree. The tree will be initially empty. 2. Read the input ASCII text file and add nodes to the BST. Each line in the input file corresponds to one record for one city. The fields in the input are tab delimited. Here are the requirements: Use ifstream data type to read the input file: string inputLine; ifstream inFile; [login to view URL]("C:\\Project2\\[login to view URL]"); while (![login to view URL]()){ // read a single line from the input file inFile >> inputLine; // parse and process the input // convert all city names to all uppercase // before inserting into the BST // insert nodes into the BST with the new information // ... }; [login to view URL](); You need to check for duplicate city names. If the city is already in the tree, don’t insert it, but display a message and skip that record. 3. Display a menu with the following options: a. Display BST ??" in in-order b. Display BST ??" in pre-order c. Display BST ??" in post-order d. Print BST Statistics Calculate and display the following: 1. Number of nodes 2. Number of leaf nodes 3. Number of Internal nodes 4. Tree height e. Search for a city (by name) ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. ## Platform windows