Heap with Complete Implementation in C++
A Heap is a type of Tree-based data structure in which the tree is a complete binary tree. Heaps can be classified into two types:
Max-Heap: The root node’s key must be the biggest among all of its offspring in a Max-Heap. For all subtrees of the Binary Tree, the same property must be true recursively.
Min-Heap: In a Min-Heap, the key present at the root node must be the smallest of all the keys present at all of its descendants. For all sub-trees of that Binary Tree, the same property must be true recursively.
All the details discuss with code in the video below:
- AVL Tree and Its Implementation in C++
- Binary Tree and Tree Traversal in C++
- Insertion Sort and Merge Sort in C++
- Bubble Sort and Selection sort Implementation in C++
- Recursion and Backtracking in C++