Algorithm Development Assignment

Binary Heap

  1. Show the result of inserting 10,12,1,14,6,5,8,15,3,9,7,4,11,13, and 2 one at a time, into an initially empty binary heap.
  2. Show the result of using the linear-time algorithm to builde a binary heap using the same input.
  3. Show the result of performing three deleteMin operations in the heap of the previous exercise.

Type and save your work in a document and upload to the assignment drop-box. You do not need to include a cover sheet, but you do need to put your namedateassignment number and instructor’s name at the top of the page.

Submit a screenshot of the executed program and the code of the program.