• think of Binary Heaps as Queues with priority
• a binary tree-based data structure is one where:
  • the binary tree is complete
  • it is heap-ordered
• Min-heap order:
• Max-heap order:
• heap order visual
• every complete binary tree is balanced

Basic Methods

Insertion

Delete / Get Min or Max

Real Life Examples

Implementation