The selection problem for a very large heap is defined as the problem of finding the k**t**h largest element in a heap whose depth is greater than k. We present an efficient algorithm to solve this problem in O(k log log n) time. The algorithm uses a binary search tree that is also an AVL tree. A couple of open questions linked with this problem are posed.
