Suppose n distinct values are stored in a binary tree. It is noted that the tree is a min-heap and a binary search tree. What does the tree look like? As we have seen, the splay tree requires the...

Suppose n distinct values are stored in a binary tree. It is noted that the tree is a min-heap and a binary search tree. What does the tree look like?

As we have seen, the splay tree requires the construction of an iterator that stores a single reference to the tree, rather than an unlimited number of references to ancestors. How does this reduction in space utilization impact the running time of the iterator?