1. This is a question about binary min-heaps. 1. Given the binary min-heap A = [1,...

Transcribed Image Text:

1. This is a question about binary min-heaps. 1. Given the binary min-heap A = [1, 60, 18, 83, 97, 68, 47, 99] do the following: (a) Draw the tree representation. [3 marks] (b) Show the steps involved when inserting the element 8. [6 marks] (c) Show the steps involved when deleting the smallest element from A (note that we are deleting from the original heap A, not from the outcome of question 1b). [6 marks] 1. This is a question about binary min-heaps. 1. Given the binary min-heap A = [1, 60, 18, 83, 97, 68, 47, 99] do the following: (a) Draw the tree representation. [3 marks] (b) Show the steps involved when inserting the element 8. [6 marks] (c) Show the steps involved when deleting the smallest element from A (note that we are deleting from the original heap A, not from the outcome of question 1b). [6 marks]

Answer rating: 100% (QA)

The question is about binary minheaps and it presents three different parts a Asking to draw the tree representation of a given binary minheap b Reque... View the full answer