Question: Originally we stored our heap in an array. Consider instead storing our heap as a doubly linked list. (1) (6 points) For a node

Originally we stored our heap in an array. Consider instead storing our 


Originally we stored our heap in an array. Consider instead storing our heap as a doubly linked list. (1) (6 points) For a node i what are the new asymptotic run times for left(i), right(i), and parent(i)? Justify your answer. (2) (6 points) How does this affect the run times of findMax(), insert(key), extract Max()? Justify your answer.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock 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 Computer Network Questions!