INSERTION IN HEAP | data structure

HOW TO INSERT A NODE IN HEAP(MAX HEAP) WE WILL LEARN IN THIS VIEDO.
data structure playlist..
https://www.youtube.com/watch?v=UpoPIB0Th8s&list=PLlQR_XAxStPdn6baWrHOTRHKWxphX0vVA
heap
https://www.youtube.com/watch?v=by9q4X1Mxj4&t=6s
deletion in heap
https://www.youtube.com/watch?v=I2n22zy-wr0&t=22s
Learn about heaps
1)A Heap is a special Tree-based data structure in which the tree is a complete binary tree. Generally, Heaps can be of two types:

Max-Heap: In a Max-Heap the key present at the root node must be greatest among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree.

Min-Heap: In a Min-Heap the key present at the root node must be minimum among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree.

What is MAX Heap and MIN Heap?
How to insert data in MAX heap? (Max Heap insertion)
How to delete data from MAX heap? (Max heap deletion)

Array Representation of Binary Tree
Complete Binary Tree
Heap
Heap Sort
Heapify
Priority Queue
In this video lecture we will learn aboutDeletion of a node from heap with the help of example.
heap sort in data structure.
heap in hindi
heap in data structure
#heap
#insertioninheap