Read question carefully and answer all parts Save Answer 1. Describe the heapify algorithm and apply...

  

Transcribed Image Text:

Read question carefully and answer all parts Save Answer 1. Describe the heapify algorithm and apply it to your list to build a Minimum Heap. Show the list (in Consider the list C, K, E, N, B, A, 1. Replace "1" in the list by another character without duplicating other characters in the list. Show the list of characters after replacing number 1 by a character of your choice. an array form) after applying the heapify algorithm. [5pts] 2. What is the index of node C in the heap? Calculate the index of the left and the right child as well as the parent index of node C in the heap. Show your calculations. [3 pts] 3. Describe the algorithm for remove element from the heap character. Show the heap after this removal. What is the worst case time complexity of this operation. [5 pts] Read question carefully and answer all parts Save Answer 1. Describe the heapify algorithm and apply it to your list to build a Minimum Heap. Show the list (in Consider the list C, K, E, N, B, A, 1. Replace "1" in the list by another character without duplicating other characters in the list. Show the list of characters after replacing number 1 by a character of your choice. an array form) after applying the heapify algorithm. [5pts] 2. What is the index of node C in the heap? Calculate the index of the left and the right child as well as the parent index of node C in the heap. Show your calculations. [3 pts] 3. Describe the algorithm for remove element from the heap character. Show the heap after this removal. What is the worst case time complexity of this operation. [5 pts]