Loading...
Uploaded by nptelhrd on Sep 24, 2008
Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi. For more details on NPTEL visit http://nptel.iitm.ac.in
Education
Standard YouTube License
hats off to Naveen Garg,Even the Contents on the slides have mistakes he managed to make them correct,Presentation is very clear n mind blowing.
indianprince4u 1 year ago 4
He did not specify what type of heap it was.
On my notes, the Priority Queue was implemented with a Binary Max Heap where the top most element is Largest. You are implementing a Binary Min Heap.
smowkmylungs 3 years ago 3
very detailed and clear explaination..
ajjuprakash1987 3 months ago
anandtechblog
algoforyou 8 months ago
Load more suggestions
hats off to Naveen Garg,Even the Contents on the slides have mistakes he managed to make them correct,Presentation is very clear n mind blowing.
indianprince4u 1 year ago 4
He did not specify what type of heap it was.
On my notes, the Priority Queue was implemented with a Binary Max Heap where the top most element is Largest. You are implementing a Binary Min Heap.
smowkmylungs 3 years ago 3