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

CS 61B Lecture 26: Balanced Search Trees

Loading...

Sign in or sign up now!
17,076
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Jul 30, 2008

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:

Download this video

LICENSE: Creative Commons (Attribution-Noncommercial-No Derivative Works).

For more information about this license, please read: http://creativecommons.org/licenses/by-nc-nd/3.0/.

High-quality MP4 Learn more

  • likes, 0 dislikes

Link to this comment:

Share to:

Top Comments

  • You sir, are an amazing teacher!

  • We should push Berkeley to ask this professor to put more lectures online hahahaha

see all

All Comments (25)

Sign In or Sign Up now to post a comment!
  • 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

Loading...

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