Min Heap: Introduction

Explore the fundamentals of Min Heaps, including building the heap from a vector using bottom-up Min Heapify, inserting new elements by percolating up, and removing the minimum element while maintaining heap properties. Understand these core operations to implement efficient priority queues and sorting algorithms in C++.