Who's Next in the Emergency Room? Heaps

Always call the most urgent patient next while new ones keep arriving, even on a day of 10,000: why an unsorted list and a sorted list both slow down, and the structure that fixes them, the heap, which keeps a tree in a plain array.

Updated

Cheat sheet: Who's Next in the Emergency Room? Heaps
Category
Data Structures
Level
Journeyman
Tags
Complete Binary Tree, data structures, heap, Max-Heap, Min-Heap