BST

Completado Publicado May 1, 2003 Pagado a la entrega
Completado Pagado a la entrega

Here is the description. It should work exactly as described. Most reasnable bid will be accepted. I'm attaching the [url removed, login to view] file, PLEASE review for full description. The project should contain the following files: [url removed, login to view] - program driver, contains the main(), menu(), pause() functions BST.h - Binary Search Tree header [url removed, login to view] - Binary Search Tree implementation BSTNode.h - Binary Search Tree Node header [url removed, login to view] - Binary Search Tree Node implementation City.h - City class header [url removed, login to view] - 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; [url removed, login to view]("C:\\Project2\\[url removed, login to view]"); while (![url removed, login to view]()){ // 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 // ... }; [url removed, login to view](); 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

## 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. 3) Complete ownership and distribution copyrights to all work purchased.

## Platform

The program will need to run on Windows ME operating system. Can you please use Microsoft visual C++ 6.0.

Programación en C Ingeniería MySQL PHP Arquitectura de software Verificación de software

Nº del proyecto: #2930973

Sobre el proyecto

1 propuesta Proyecto remoto Activo May 3, 2003

Adjudicado a:

mihaido

See private message.

$17 USD en 14 días
(29 comentarios)
4.7