Show Bid Request
C++ Homework Project
Bid Request Id: 32743
|
|
|
|
Posted by: |
BIGgZOOM (5 ratings)
(Software buyer rating 9.8 )
|
|
Non-action Ratio: |
Above Average - 33.33%
|
Buyer Security Verifications: |
Unverified
|
|
Approved on: |
Oct 27, 2002
10:56:56 PM EDT
|
|
Bidding Closes: |
Nov 2, 2002
11:29:23 PM EDT
|
|
Viewed (by coders): |
204 times
|
|
Deadline: |
11/3/2002
TIME EXPIRED
|
|
|
|
|
Description:
The purpose of this assignment is in two folds:
to understand and implement BST ADT, and
to learn to use BST.
For the first part, you are to implement the BST ADT. The minimum requirement for BST is to implement at least the member functions given in the lecture. Do not use the data structures provided in STL (standard template library) such as queue, stack, etc, in implementing the BST. If you need such data structures, use your own implementation.
For the second part, you are to write a program that creates and maintains a pair of binary search trees, called OAK and PINE, using the BST you implemented.
Data Structures
You will need two binary search trees, OAK and PINE. Each node on the trees contains the following information:
Name
Phone number
Pointers to left/right subtree
The nodes on each tree are to be ordered by name.
Input
The input to the program is a series of commands. The program is to read the input interactively. That is, the program displays a menu (list of available commands) and lets the user select one from it. Depending on the command selected, the program prompts the user for further input if necessary to complete the selected command. See the sample session below for detail.
Commands
The following are the commands to the program. In addition to executing the command, you must echoprint each command as it is read in. A blank line should be output after each command to improve readability. See the sample session below for detail.
ADD <Name>
The specified person should be added to the tree designated by . You may assume that no two people have the same name.
DELETE <Name>
Delete the specified <Name> from the designated tree. You cannot assume that the person is actually on the tree. If the person is not found in the tree, print appropriate message.
CHECK <Name>
Check whether the specified <Name> is on the designated tree, and print an appr
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:
windows 98 , microsoft visual c++ 6.0
Must be 100% finished and received by buyer on:
Nov 3, 2002 EDT
Deadline legal notes: All times are expressed in the time zone of the site EDT (UT - 5). If the buyer omitted a time, then the deadline is 11:59:59 PM EDT on the indicated date.
Remember that contacting the other party outside of the site (by email, phone, etc.) on all business projects < $500 (before the buyer's money is escrowed) is a violation of both the software buyer and seller agreements.
We monitor all site activity for such violations and can instantly expel transgressers on the spot, so we thank you in advance for your cooperation.
If you notice a violation please help out the site and report it. Thanks for your help.
|
|
|
Bidding/Comments:
|
All monetary amounts on the site are in United States dollars.
Rent a Coder is a closed auction, so coders can only see their own bids and comments. Buyers can view every posting made on their bid requests. |
See all rejected bids (and all comments)
| Name |
Bid Amount
|
Date |
Coder Rating |
|
|
|
This bid was accepted by the buyer!
|
$9 (USD)
|
Oct 28, 2002
10:08:45 AM EDT
|
10
(Excellent)
|
|
|
Hi,
The program which I give you will be properly indented and well-commented. Let me know if you are interested. I'll give you the program immediately. Thanks. |
|
|
|
|
|
|