Min Heap: Introduction
A brief introduction to min heaps and how elements are inserted and removed from them.
We'll cover the following...
Building a min heap
Building a mMin hHeap # As mentioned in a previous lesson, min heaps follow the min heap property, which means that the key at the parent node is always smaller than the keys at the child nodes. Heaps can be implemented using vectors. Initially, elements are placed in nodes in the ...