The code in file "hw5-stree.cpp" reads a set of integers from file and inserts them into a binary search tree. You are asked to implement two functions max() and depth() that compute the maximum element and the depth of the binary search tree. The function prototypes are given in file "d_stree.h" lines 174-212. You need to complete the implementation of these four functions so that max() return an iterator pointing to the maximum tree node, and depth() returns an integer indicating the depth of the tree. Note that all you need to do is to complete the implementation of the two functions computeDepth() and maxNode(). The max() and depth() functions call these two functions.
The provided code also computes the depth of the complete binary search tree with the same number of nodes. You are asked to run the code with different numbers of tree nodes, summarize your results in a table, and analyze your results based on our classroom discussions.
If you compiled your code with
g++ hw5-stree.cpp -o stree
you can use for example
./stree 1000
to read the first 1000 integers and build the tree.