a) Show what will happen if the following operations are done one after 6 another on...

 

Transcribed Image Text:

a) Show what will happen if the following operations are done one after 6 another on the min heap given below. Once the tree changes after an operation, the next operation will be done on the changed tree. You must show the state of the tree after each step. Operations: ENQUEUE(7), ENQUEUE(13), DEQUEUE() 26 44 35 14 33 31 53 10 42 19 27 27 a) Show what will happen if the following operations are done one after 6 another on the min heap given below. Once the tree changes after an operation, the next operation will be done on the changed tree. You must show the state of the tree after each step. Operations: ENQUEUE(7), ENQUEUE(13), DEQUEUE() 26 44 35 14 33 31 53 10 42 19 27 27