A.06Reference4 topics
Heap complexity
Part of Chapter A: Algorithm and Data Structure Complexity Reference.
Outline only
The topics below come from the curriculum. Their written explanations and animations have not been published yet.
A.06.1
Peek O(1)
Explanation coming soon.
A.06.2
Push/pop O(log n)
Explanation coming soon.
A.06.3
Heapify O(n)
Explanation coming soon.
A.06.4
Search arbitrary element O(n)
Explanation coming soon.