Min Heap: Introduction
This lesson will give a brief introduction to Min-Heaps and how elements are inserted and removed from them .
We'll cover the following...
Building a Min-Heap
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 same order as they appear in the vector. Then a function is called over the whole ...
Access this course and 1400+ top-rated courses and projects.