Heap is an important data structure which forms the basis of priority queues in Java. It is a brilliant data structure to solve problems like find kth element and skyline problems and many array based problem. In this video I will talk about the properties of Heap data structure and implement it using array.
0:00 Instroduction
1:10 Properties of Heap
9:16 Operation done on heap
13:19 Implementing Heap
14:00 Peek method implementation
15:14 Implementing Insert method
23:54 Heapify Up method
28:50 Implementing Poll Method
33:31 Heapify down method
37:50 Test Case
You can buy us a coffee at : www.buymeacoffee.com/thetechg...
system design: • System Design | Distri...
DS for beginners: • Arrays Data Structures...
leetcode solutions: • Leetcode 84 | Largest ...
github: github.com/TheTechGranth/theg...
facebook group : / 741317603336313
twitter: / granthtech