CS 61B Lecture 24: Priority Queues

CS 61B: Data Structures - Fall 2006

Instructor Jonathan Shewchuk

Fundamental dynamic data structures, including linear lists, queues, trees, and other linked structures; arrays strings, and hash tables. Storage management. Elementary principles of software engineering. Abstract data types. Algorithms for sorting and searching. Introduction to the Java programming language.

http://www.cs.berkeley.edu

Category:

Education

Tags:

• CS
• 61b
• priority
• queues
• shewchuk
• ucberkeley
• lecture
• yt:quality=high

[naa43213]

Well, here is the thing, i've read a couple of articles as well as a book that talk about this issue of priority queue and heap, and i got like an 80% out of the concept but still needed to overcome the weaknesses that i had on this topic. Now, when i watch this video clip i actually got the whole idea of such topic. Great explanations on step by step with clarifying any subtopic by giving great related kind of examples to accomplish the idea of in depth. Thankful for uploading such clip.

[branch2washington]

he is very smart

[masrawy2222]

mashofsh 7d hena men cmp2013 ><

[jyanofski]

@blytqb 

[jyanofski]

thanks

[jyanofski]

good comment

[brx360x]

thumbs up if he looks like the smart guy from criminal minds

[zankalony2014]

جمييل يا وااد ايه الحلاوه دي

مستحمي شكلك

[hsaziz]

@cpowel2 Actually UC Berkeley, not Stanford.

[Killable1337]

@cpowel2 UCBerkeley, not Stanford

[cpowel2]

@amalwithoutme

cause that;s how a binary heap works and its not necessary for the parent to be less than its children this representation is done with a min binary heap there is a max binary heap where all children are less. Plus there are like a gazillion other styles of heaps, leftist, fibonacci, etc...

[cpowel2]

good lecturer explains things really clearly thanks to Stanford for posting such great videos really good for a review before a test or if you are having trouble with a concept from class.