Quick Facts

  • Complete Binary Tree
  • Either a Min-Heap or Max-Heap
  • Self Balancing
  • Two most important operations are Insertion and the Extraction of highest priority element.
  • The node at the top of the Heap has the greatest priority, the same is true for every node recursively moving down the tree structure.
  • Moving down the tree, each level has twice as many nodes as the previous level.
  • Min-Heap is synonymous with Priority Queue
  • HeapSort uses a Max-Heap
  • An Array is a great data structure for storing nodes in a Heap.
  • Building helper functions greatly assists in calculations of indices, swapping node positions, and more.

Leave a Reply