PROBLEM 1: Add to the General Binary Tree code given in class (found on the web site) two methods • A method that will compute the height of the binary tree. • A method that will compute the average height of the leaves PROBLEM 2: The general binary tree class has a method named buildTree that creates a binary tree from the preorder and inorder traversals of the tree given in an array. You are to write (and test) a similar method named buildTreePost that will accept the postorder and inorder traversals of a binary tree and build the binary tree. PROBLEM 3: Given a binary search tree A and a key value K, write a method for the binary search tree class that will do the following. It is to "split" the binary search tree into two binary search trees: • Binary search tree B that contains all elements in binary search tree A that have a key less than K • Binary search tree C that contains all elements in binary search tree A that have a key greater than K
## 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
dev C++ compiler