Respond to the following:
In a BST, what is the complexity required to remove the minimum element? In a BST, what is the complexity required to find (but not remove) the minimum element?
In a heap, what is the complexity required to remove the minimum element? In a heap, what is the complexity required to find the minimum element?
Suppose you were to use a binary search tree (BST) to represent a priority queue. How could you adapt a BST so that finding the minimum element is 0(1)?