$6\mathrm{.}10$ a$.$ Give an algorithm to $$nd 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 $$nds an arbitrary item X in a binary heap using at most

roughly $3$N$/4$ comparisons.