Question: Suppose that A is an array whose integer elements are organized into a max-heap. Also suppose that e is an integer. Write an algorithm IS-IN-MAX-HEAP(

Suppose that A is an array whose integer elements are organized into a max-heap. Also suppose that e is an integer. Write an algorithm IS-IN-MAX-HEAP( A , e ) that tests if e is an element of A . Your algorithm must not change A , and it must not make copies of A . It must avoid visiting all elements of A where possible—so it must not use linear search. You may state your answer in English, in pseudocode, or in a programming language.

Step by Step Solution

3.43 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

To find whether an element e exists in a maxheap without searching through all elements we need to l... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!