binary Search tree

Closed Posted Oct 15, 2002 Paid on delivery
Closed Paid on delivery

This program is to implement the binary-search-tree(BST)operation in C++. search, insert, and delete. write a function to print the elements of abinary tree in preorder. for ease of reading, use parenthesis around each subtree. (when a call is made to print a tree or a subtree print a "(" at the beginning and a ")" at the end.) perform the following operations from the main program. After eash insert or delete operation, print the operation in one line and the resulting tree on the next line. -create an empty array -insert sone integer numbers such as 23 59 64, ... -delete some numbers (with error handeling) -search some numbers (with error handeling)

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. I am using borland 5.5 compiler for this project. 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. 4) breif description of the work and how the program works

## Platform

win 2000, C++, borland 5.5 compiler

C Programming Engineering MySQL PHP Software Architecture Software Testing

Project ID: #2876870

About the project

5 proposals Remote project Active Oct 19, 2002

5 freelancers are bidding on average $28 for this job

soniainfotech

See private message.

$5.1 USD in 14 days
(11 Reviews)
4.7
rozarus

See private message.

$11.05 USD in 14 days
(52 Reviews)
3.2
kandycomput

See private message.

$4.25 USD in 14 days
(16 Reviews)
2.5
marianvw

See private message.

$34 USD in 14 days
(0 Reviews)
0.0
diegofliess

See private message.

$85 USD in 14 days
(0 Reviews)
0.0