CS 61B Lecture 25: Binary Search Trees

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
• binary
• search
• trees
• shewchuk
• ucberkeley
• lecture
• yt:quality=high

[lycheewater]

Is it just me or does he look/sound like John Malkovich?

[hexam1ner]

@tantrikwizard sure u can do a better job!! if u r so good, come up with ur own video as**ole.

learn to be grateful for what u r getting for free.

[ShokoDemon]

@LilKilla15 no it isn't, @ 10:12 

[eventviewer26]

Thanks for the video sir.. But I have a question.. why do we allow duplicate keys in this kind of structure? I just want to clarify it thanks.

[MoonLightFacade]

They use Java as an example. Pffft.

[LilKilla15]

The invariant is wrong: Left sub tree is less than root. Right subtree is GREATER THAN OR EQUAL TOO.

[rpowell1986]

Great video many thanks. However I don't agree with binary search trees allowing multiple keys of the same value. As it will result in retrieving the same key each you search for it & not the other key

[pogota1]

greatttttttttttttttttttttttttt­ttttttttttttt! i love you i mustt say :)

[smayengbam]

thank you for the excellent presentation.

[RohitDumbre86]

This proff is really passionate into teaching .. other proffs usually don't like their stuff to go online

[thebuzz2010]

This is very good!

[dineshthedemonised]

hes cool