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
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).
Thread model: posix
gcc version 3.2.2 20030222 (Red Hat Linux 3.2.2-5)