Question: Help write pseudo code in Java Given a heap H and a key k, give an algorithm to compute all the entries in H having
Given a heap H and a key k, give an algorithm to compute all the entries in H having a key less than or equal to k. For example, given the heap shown in the following figure and query k = 7, the algorithm should report the entries with keys 2, 4, 5, 6, and 7 (but not necessarily in this order). Your algorithm should run in time proportional to the number of entries returned, and should not modify the heap
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
