A. In ([url removed, login to view]) you were given the code for binary tree (binaryTreeType ) and binary search tree(bSearchTreeType) . Assuming that you are storing integers values in the tree nodes, and extend the binary search tree code to do the following:
1. Include the member function display(root) that displays the content of a BST.
2. Include the member function singleParentCount(root) that returns the number of nodes in the tree that have only one child.
3. Include the member function lessThanValueCount(root, value) that returns the number of nodes in the tree that contains value less than the parameter value.
B. Use your code to find and plot the running time that it takes code to insert a large list of random items in to the BST. Try it for different list sizes and plot the results in graph. Repeat the experiment with SORTED lists now, and plot the results on the same graph. Comment on the performance of your algorithm with sorted unsorted lists.