CS 61B Lecture 26: Balanced Search Trees



Uploaded by: ucberkeley
Video Description:
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


Tags for this video: 61b balanced CS lecture search shewchuk trees ucberkeley

Find more videos in the "Education" category
See more videos uploaded by ucberkeley

Related Videos
CS 61B Lecture 35: Amortized AnalysisCS 61B Lecture 23: Trees and TraversalsCS 61B Lecture 32: Sorting III
cs-61b-lecture-35-amortized-analysis.htmlcs-61b-lecture-35-amortized-analysis.htmlcs-61b-lecture-35-amortized-analysis.html
CS 61B Lecture 37: Expression ParsingCS 61B Lecture 11: InheritancesCS 61B Lecture 31: Disjoint Sets
cs-61b-lecture-35-amortized-analysis.htmlcs-61b-lecture-35-amortized-analysis.htmlcs-61b-lecture-35-amortized-analysis.html


Share This Video:       StumbleUpon       del.icio.us       Reddit       digg       Furl       Spurl       Simpy       YahooMyWeb


Comments for this video: Show || Hide
Comments for this video on YouTube
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )
( 3 decades ago by )



Tell a friend:


URL 
Embed Code