| | | | | |

The Push Heap Algorithm

  • Add new data at next leaf
  • Repair upward
  • Repeat
    • locate parent
    • if POT not satisfied
    •   swap
    • else
    •   stop
  • Until POT

| | Top of Page | 14. Trees 1: Theory, Models, Generic Heap Algorithms, Priority Queues - 14 of 22