Processing math: 100%
Close
Close Window

Show Source |    | About   «  30.15. 2-3+ Trees   ::   Contents   ::   30.17. Sorting Part 1  »

30.16. Heaps

30.16.1. Heaps

30.16.1.1. Complete Trees

Complete binary tree node numbering
Position01234567891011Parent00112233445Left Child1357911Right Child246810Left Sibling13579Right Sibling246810

30.16.1.2. Heap insert

0 / 0 Settings
<<<>>>

  1. 880
  2. 851
  3. 832
  4. 723
  5. 734
  6. 425
  7. 576
  8. 67
  9. 488
  10. 609
  11. 10
Created with Raphaël 2.1.2
88
85
83
72
73
6
48
60
42
57
Proficient Saving... Error Saving
Server Error
Resubmit

30.16.1.3. Building a Heap

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

30.16.1.4. Building a Heap Proof

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

30.16.1.5. Delete the maximum value

Settings

Proficient Saving... Error Saving
Server Error
Resubmit

   «  30.15. 2-3+ Trees   ::   Contents   ::   30.17. Sorting Part 1  »

nsf
Close Window