Heaps, Heap Sort, and Priority Queues Sorting III / Slide 2 Background: Binary Trees Has a root at the topmost Parent(x) level Each node has zero, one or two children x A…
