CS 61B Lecture 26: Balanced Search Trees
Top Comments
All Comments (25)
-
Topics in this lecture (CS 61B - L26):
> 2-3-4 keys (a.k.a: "(2,4) keys")
> "Another approach to duplicate keys"
(Like this comment so other viewers get the summary)
-
thank you i'm from ksa my Instructor didn't do so good in this subject so i watch this Lecture and understood it you are a good Teacher
-
Yes, this is an amazing series of lectures on data structures...wish he did tries and suffix trees too!!
-
It's so hard... Can't be good programmer.
-
In response to all the people griping about their horrible comp. sci. professors I definitely concur. Why are they always horrible half assed non-explaining arrogant dicks. I am so tired of paying money to learn everything on my own at least there are lectures like this online
-
@xzminx Thanks, but I figured it out.
-
@Time4TruthDOTorg check out the heap data structure
-
I need a tutorial that explains a balanced search tree with priorities...HELP!
-
is Berkeley a private university .. prof are really energetics and have the talent of illustrating and explaining well



You sir, are an amazing teacher!
bearLY85 2 years ago 31
We should push Berkeley to ask this professor to put more lectures online hahahaha
tzhazha 2 years ago 19