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
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:













