1. Give an algorithm to find all nodes less than some value, X, in a binary heap. Your algorithm should run in O(K), where K is the number of nodes output.

Note: if submitting code, please submit atleast 3 test cases.