1. Describe a simple modification to the BST that will allow it to easily support finding the Kth smallest value in Θ(log n) average case time. Then write a pseudo-code function for finding the Kth smallest value in your modified BST.
2. What are the minimum and maximum number of elements in a heap of height h?
3. Where in a max-heap might the smallest element reside?