Skip to contentOpens in a new tab

Esc

↑↓navigate↵open⌘Jpreview

Introduction
Progress
Phase 1: Linear Structures
Phase 2: Nodal & Grid
Phase 3: Hierarchical
Phase 4: Relational
Phase 5: Decision Space
- Backtracking

Phase 3: Hierarchical

Heap / Priority Queue

The largest or smallest item is always at the top, and it is removed in logarithmic time.

Last updated on September 24, 2026

Was this page helpful?

Thanks for your feedback!

PreviousLowest Common Ancestor of a Binary Search Tree NextMerge k Sorted Lists

Open in chat

Open in ChatGPT Open in Claude Open in T3 Chat Open in Scira Open in Cursor