Data Structures C++ - Binary Heaps - Part One - Insertion

We introduce one of the most important and useful data structures here; Binary Heaps!

Binary Heaps are commonly used in implementations of Priority Queues, an abstract data structure which supports constant-time top, and O(Log2N) insertion and removals of items, highest or lowest first.

This series guides you through the properties of Binary Heaps, and details in its implementations.

Concepts:
- Implementing insert(), and its private method; heapifyUp()