Skip to content
BranchesTags

Latest commit

 

History

39 Commits

Folders and files

NameName
Last commit message
Last commit date
.gitbook/assets
.gitbook/assets
 
 
1.-introduction
1.-introduction
 
 
10.-inheritance-ii-extends-casting-higher-order-functions
10.-inheritance-ii-extends-casting-higher-order-functions
 
 
11.-inheritance-iv-iterators-object-methods
11.-inheritance-iv-iterators-object-methods
 
 
12.-asymptotics-i
12.-asymptotics-i
 
 
13.-asymptotics-ii
13.-asymptotics-ii
 
 
14.-asymptotics-iii
14.-asymptotics-iii
 
 
15.-disjoint-sets
15.-disjoint-sets
 
 
16.-bsts
16.-bsts
 
 
17.-b-trees
17.-b-trees
 
 
18.-red-black-trees
18.-red-black-trees
 
 
19.-heaps-and-priority-queues
19.-heaps-and-priority-queues
 
 
20.-tree-traversals-and-graphs
20.-tree-traversals-and-graphs
 
 
21.-graph-traversals-and-implementations
21.-graph-traversals-and-implementations
 
 
22.-shortest-paths
22.-shortest-paths
 
 
23.-minimum-spanning-trees
23.-minimum-spanning-trees
 
 
24.-reductions-and-decomposition
24.-reductions-and-decomposition
 
 
25.-hashing-i
25.-hashing-i
 
 
26.-hashing-ii
26.-hashing-ii
 
 
27.-prefix-operations-and-tries
27.-prefix-operations-and-tries
 
 
28.-software-engineering-i
28.-software-engineering-i
 
 
29.-software-engineering-ii
29.-software-engineering-ii
 
 
30.-basic-sorts
30.-basic-sorts
 
 
31.-quicksort
31.-quicksort
 
 
32.-more-quick-sort-sorting-summary
32.-more-quick-sort-sorting-summary
 
 
33.-sorting-and-algorithmic-bounds
33.-sorting-and-algorithmic-bounds
 
 
34.-radix-sorts
34.-radix-sorts
 
 
35.-sorting-and-data-structures-conclusion
35.-sorting-and-data-structures-conclusion
 
 
36.-software-engineering-iii
36.-software-engineering-iii
 
 
37.-software-engineering-iv
37.-software-engineering-iv
 
 
38.-compression-and-complexity
38.-compression-and-complexity
 
 
39.-compression-complexity-p-np
39.-compression-complexity-p-np
 
 
9.-inheritance-i-interface-and-implementation-inheritance
9.-inheritance-i-interface-and-implementation-inheritance
 
 
9999.-inheritance-ii-polymorphism-comparators-comparables-OLD-DO-NOT-USE
9999.-inheritance-ii-polymorphism-comparators-comparables-OLD-DO-NOT-USE
 
 
.DS_Store
.DS_Store
 
 
2.-defining-and-using-classes.md
2.-defining-and-using-classes.md
 
 
3.-references-recursion-and-lists.md
3.-references-recursion-and-lists.md
 
 
4.-intlists.md
4.-intlists.md
 
 
5.-testing.md
5.-testing.md
 
 
6.-sllists.md
6.-sllists.md
 
 
7.-dllists-and-arrays.md
7.-dllists-and-arrays.md
 
 
8.-resizing-arraylist.md
8.-resizing-arraylist.md
 
 
README (1).md
README (1).md
 
 
README.md
README.md
 
 
SUMMARY.md
SUMMARY.md
 
 
disclaimer.md
disclaimer.md
 
 

Repository files navigation

Fall 2026 Textbook

This is the Fall 2026 edition of the CS61B textbook. This book is intended as a written accompaniment for the lectures, as opposed to being a full data structures textbook.

If you are interested in a serious data structures textbook that covers the topics of this class, we recommend:

  • Algorithms, 4th edition by Robert Sedgwick, Kevin Wayne
  • Algorithms Illuminated by Tim Roughgarden
  • The Art of Computer Programming (Volume 3) by Donald Knuth

About

CS61B Fall 2026 Textbook

Resources

Readme
Activity
Custom properties

Stars

0 stars

Watchers

0 watching

Forks

1 fork
Report repository

Releases

Packages

Contributors