Give an efficient algorithm to find all keys in a min heap that are smaller than a provided valueX. The provided valuedoes nothave to be a key in the min heap. Evaluate the time complexityof your algorithm.

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.