Heaps in C++ - Heap Sort - Insertion-Deletion in Heap - Priority Queue STL

Learn about heaps in C++, including heap sort, insertion and deletion operations, and the priority queue STL. Explore the concepts of complete binary trees, max-heaps, and min-heaps. Dive into the implementation of a heap class, covering insertion and deletion algorithms. Master the heapify algorithm and its code implementation. Understand heap sort and its implementation. Conclude with an introduction to the priority queue data structure. Follow along with code examples and practical demonstrations to solidify your understanding of these essential data structures and algorithms.

Syllabus

- Introduction to Heaps & CBT
- Promotion
- Max-Heap or Min-Heap
- Insertion in heap
- Heap Class Implementation
- Insertion Code
- Deletion in Heap
- Deletion Code
- Heapify Algorithm
- Heapify Code
- Heap Sort
- Heap Sort Code
- Priority Queue