(b) Propose an efficient algorithm (only pseudocode) to find all nodes less than some value X in a binary min-heap. Analyze its complexity. (c) Write (in Java) a method replaceKey in the MaxHeap class ...