Learn Heaps
Learn the data structure of heaps using Python. A heap is a specialized type of tree with many applications.
StartKey Concepts
Review core concepts you need to learn to master this subject
Heap Implementation
Heap Implementation
Heaps are typically implemented with a data structure such as an array or Python list. These sequential structures allow access to elements in a particular order which is key to efficient use of heaps. Although binary trees are helpful for understanding the relationships between nodes of a heap, implementation using a tree is less efficient for storage and retrieval of elements.
Heaps: Conceptual
Lesson 1 of 2
How you'll master it
Stress-test your knowledge with quizzes that help commit syntax to memory