Instructions:

Your task is to reproduce the behavior of the buildheap algorithm to create a min heap from the data initially in the array. The heap is displayed in both its logical tree and physical array forms. Clicking on an element in one will also update the other. You can swap two records in the heap by first clicking one, then the other.

Score: / , Points remaining: , Points lost:

  1. 560
  2. 571
  3. 462
  4. 683
  5. 904
  6. 645
  7. 176
  8. 467
  9. 188
  10. 599
Created with Raphaël 2.1.2
56
57
46
68
90
46
18
59
64
17