Heaps & Priority Queues
A complete binary tree, stored flat in an array, that keeps the smallest (or largest) element one O(log n) extraction away — the standard way to build a priority queue.
Your learning journey
Every module Axiom offers for heaps & priority queues — work through them in order, or jump to what you need.
Explains the heap property, complete binary trees stored as arrays, insert/extract, heapify, and priority queues.
Animates build-heap and repeated extract-max on a live tree, shown alongside its backing array.
Checks that the heap property (parent vs children only, not a full ordering) is understood.
Answers follow-up questions and adapts the explanation to the learner's level.
One-glance recall of the array indexing trick, insert/extract, and the Top-K pattern.
What to learn next
From Axiom's Knowledge Graph.