Program Specification:
Build a binary search tree, using links (not an array) for 15 records. The data in these records will
hold names and their associated weights. Read the data from the screen.
Required functionality (Each # should be separate methods):
1. Build the tree from the unique set of names (names are the key value) and their associated
weights.
2. Execute a preorder traversal
3. Execute an inorder traversal
4. Execute a postorder traversal
5. Find and print the height of the tree using recursion, do not add a height variable to the
tree structure, the algorithm stack should hold this.
6. Determine the number of leaves and print the result (remember a leaf has no children).
7. Implement search functionality that will search for a name and indicate the weight for
that individual if they exist in the structure, otherwise stating no match exists.
8. Determine the lowest weight contained in the tree.
9. Find the first name in alphabetical order (this should not go through every node, unless
the tree happens to be a linked list).
Hello
We are a team of Electrical Engineers with experience in embedded and software solutions. We have worked on projects GUI based software involving network programming, algorithm development and optimizations. Java and C++ are our languages of preference.
Kindly mention your timeline details. We can deliver fully commented and properly documented code in C++ for your Binary Search Tree requirements.
Looking forward to working for you.
Hello! I am very interested in your project and I would like to work for you. I am experienced in C++ development and it would be my pleasure do to your work. Please contact me if you want to colaborate. Have a nice day!