Terminé

Binary Search Tree (BST)

This bid deals with binary search trees.

I have provided the class file and implementation file for a Binary Search Tree (class BST) and a

Stack (class Stack).

[url removed, login to view] is the program I will use to test your code.

You DO NOT need to change [url removed, login to view], bst.h, stack.h or [url removed, login to view]

You DO need to change [url removed, login to view]

In that file I have implemented a method named preOrderNonRecursive() which

is a non-recursive preOrder traversal. That method does not call itself but instead maintains its own

stack for traversing the tree.

You have to complete the methods inOrderNonRecursive() and postOrderNonRecursive(). You may use any code you find

in [url removed, login to view] to complete your methods.

Hint: The code for preOrderNonRecursive() can be very useful in inOrderNonRecursive() and

postOrderNonRecursive().

Thank You

## Deliverables

1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.

2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):

a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.

b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.

3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).

## Platform

LINUX

Thread model: posix

gcc version 3.2.2 20030222 (Red Hat Linux 3.2.2-5)

Compétences : Ingénierie, Linux, MySQL, PHP, Architecture Logicielle, Tests de Logiciels

en voir plus : use of binary search tree, use of binary, trees search, tree red, tree binary search, traversing binary trees, traversing a binary search tree, the red trees, source code for binary search in c, search trees, search red, search in tree, search in binary tree, search for trees, search for red, search bst, search binary tree, search binary search tree, search binary, search a tree

Concernant l'employeur :
( 7 commentaires ) United States

Nº du projet : #3186777

Décerné à:

vs19841

See private message.

%selectedBids___i_sum_sub_7% %project_currencyDetails_sign_sub_8% USD en 5 jours
(13 Commentaires)
1.8

8 freelance font une offre moyenne de $7 pour ce travail

unamigo

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(51 Commentaires)
5.3
zatvw

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(6 Commentaires)
4.1
nbolshakovvw

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(11 Commentaires)
4.1
saifullahbaig

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(9 Commentaires)
2.2
urugvw

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(0 Commentaires)
0.0
ingmath

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(1 Évaluation)
0.0
kryppton

See private message.

%bids___i_sum_sub_35% %project_currencyDetails_sign_sub_36% USD en 5 jours
(0 Commentaires)
0.0