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

 

Transcribed Image Text:

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. 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.