Answer:
Starting from root, recursively traverse the min-heap. Once we find a key with value less than our X, we know that every key in subtree of that key will be also smaller than our X. Otherwise, we should keep traversing.
Explanation:
The complexity of this algorithm will be O(N) where N is the number of keys in our min-heap.
Both can be used for saving documents
