Data Structures and Algorithms with Object-Oriented Design Patterns in Python

Binary Heaps

A binary heap is a heap-ordered binary tree which has a very special shape called a complete tree. As a result of its special shape, a binary heap can be implemented using an array as the underlying foundational data structure. Array subscript calculations are used to find the parent and the children of a given node in the tree. And since an array is used, the storage overhead associated with the subtree instance attributes contained in the nodes of the trees is eliminated.

Complete Trees
Implementation
Putting Items into a Binary Heap
Removing Items from a Binary Heap