Alert icon
We're changing our privacy policy. This stuff matters.  Learn more  Dismiss

Lecture - 20 Priority Queues

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
24,507
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by 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

Category:

Education

Tags:

License:

Standard YouTube License

Link to this comment:

Share to:

Top Comments

  • 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.

  • 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.

see all

All Comments (5)

Sign In or Sign Up now to post a comment!
  • very detailed and clear explaination..

  • anandtechblog

    

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more