A Give An Algorithm To Find All Nodes Less Than

a. 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.
b. Does your algorithm extend to any of the other heap structures discussed in this chapter?
c. Give an algorithm that finds an arbitrary item X in a binary heap using at most roughly 3N/4 comparisons.

Posted in Uncategorized