H4. 2. Suppose we are given a binary heap H with integer elements and an integer x.

H4.

Transcribed Image Text:

2. Suppose we are given a binary heap H with integer elements and an integer x. Describe an algorithm that prints every element in H that is at most x. Your algorithm should run in O(k) time where k is the number of elements you print. You may describe your algorithm in Java (after stating precisely how you expect H to be stored), using pseudocode, or with a careful and precise English description. You should also briefly explain why your algorithm is correct and why its running time is O(k). 2. Suppose we are given a binary heap H with integer elements and an integer x. Describe an algorithm that prints every element in H that is at most x. Your algorithm should run in O(k) time where k is the number of elements you print. You may describe your algorithm in Java (after stating precisely how you expect H to be stored), using pseudocode, or with a careful and precise English description. You should also briefly explain why your algorithm is correct and why its running time is O(k).