Searching...
- Home
- Video Lectures
- About The Professor
Course
| Subject: | Computer Science |
| Views: | 98,616 |
Educator
| Name: | University of California, Berkeley (UC Berkeley) |
| Type: | University |
Instructor
Name
Jonathan Shewchuk
Lecture Description
Binary Search Trees
Course Index
- Course Overview
- Using Objects
- Defining Classes
- Types and Conditionals
- Iteration and Arrays I
- Iteration and Arrays II
- Linked Lists I
- Linked Lists II
- Stack Frames
- Testing
- Inheritances
- Abstract Classes
- Java Packages
- Exceptions
- More Java
- Game Trees
- Encapsulation
- Encapsulated Lists
- Asymptotic Analysis
- Algorithm Analysis
- Hash Tables
- Stacks and Queues
- Trees and Traversals
- Priority Queues
- Binary Search Trees
- Balanced Search Trees
- Graphs
- Weighted Graphs
- Sorting I
- Sorting II
- Disjoint Sets
- Sorting III
- Sorting V
- Splay Trees
- Amortized Analysis
- Randomized Analysis
- Expression Parsing
- Garbage Collection
- Augmenting Data Structures
Course Description
CS 61B: Data Structures - Fall 2006. 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.
Comments
There are no comments.
Be the first to post one.
Posting Comment...
