Heap Algorithms | Extract Max | Increase Key | Decrease Key | Insert Element

This video explains the most important heap algorithms along with their implementations using simple examples and dry run.I can guarantee that you will master heap algorithms once you watch this video complete.I have explained extract max algorithm, increase key algorithm, decrease key algorithm and insert element algorithm for a max heap.I have also shown the pseudo codes for all these algorithms.At the end of the video, I have compared all the operations for a max heap.Once you understand heap algorithms on max heap then you can very easily implement these for min heap as well.

Write a comment