Skip to content

Berkeley-CS61B/fa25-gitbook

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
.gitbook/assets
.gitbook/assets
 
 
1.-introduction
1.-introduction
 
 
10.-inheritance-ii-extends-casting-higher-order-functions
10.-inheritance-ii-extends-casting-higher-order-functions
 
 
10.-inheritance-ii-polymorphism-comparators-comparables
10.-inheritance-ii-polymorphism-comparators-comparables
 
 
11.-inheritance-iii-subtype-polymorphism-comparators-comparable
11.-inheritance-iii-subtype-polymorphism-comparators-comparable
 
 
12.-inheritance-iv-iterators-object-methods
12.-inheritance-iv-iterators-object-methods
 
 
13.-asymptotics-i
13.-asymptotics-i
 
 
14.-disjoint-sets
14.-disjoint-sets
 
 
15.-asymptotics-ii
15.-asymptotics-ii
 
 
16.-adts-and-bsts
16.-adts-and-bsts
 
 
17.-asymptotics-iii
17.-asymptotics-iii
 
 
18.-b-trees
18.-b-trees
 
 
19.-red-black-trees
19.-red-black-trees
 
 
20.-hashing-i
20.-hashing-i
 
 
21.-hashing-ii
21.-hashing-ii
 
 
22.-heaps-and-priority-queues
22.-heaps-and-priority-queues
 
 
23.-tree-traversals-and-graphs
23.-tree-traversals-and-graphs
 
 
24.-graph-traversals-and-implementations
24.-graph-traversals-and-implementations
 
 
25.-shortest-paths
25.-shortest-paths
 
 
26.-minimum-spanning-trees
26.-minimum-spanning-trees
 
 
27.-prefix-operations-and-tries
27.-prefix-operations-and-tries
 
 
28.-software-engineering-i
28.-software-engineering-i
 
 
29.-reductions-and-decomposition
29.-reductions-and-decomposition
 
 
30.-basic-sorts
30.-basic-sorts
 
 
31.-quicksort
31.-quicksort
 
 
32.-software-engineering-ii
32.-software-engineering-ii
 
 
33.-more-quick-sort-sorting-summary
33.-more-quick-sort-sorting-summary
 
 
34.-software-engineering-iii
34.-software-engineering-iii
 
 
35.-sorting-and-algorithmic-bounds
35.-sorting-and-algorithmic-bounds
 
 
36.-radix-sorts
36.-radix-sorts
 
 
37.-sorting-and-data-structures-conclusion
37.-sorting-and-data-structures-conclusion
 
 
38.-software-engineering-iv
38.-software-engineering-iv
 
 
39.-compression-and-complexity
39.-compression-and-complexity
 
 
40.-compression-complexity-p-np
40.-compression-complexity-p-np
 
 
9.-inheritance-i-interface-and-implementation-inheritance
9.-inheritance-i-interface-and-implementation-inheritance
 
 
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.-sllists.md
4.-sllists.md
 
 
5.-dllists.md
5.-dllists.md
 
 
6.-arrays.md
6.-arrays.md
 
 
7.-testing.md
7.-testing.md
 
 
8.-arraylist.md
8.-arraylist.md
 
 
README (1).md
README (1).md
 
 
README.md
README.md
 
 
SUMMARY.md
SUMMARY.md
 
 
disclaimer.md
disclaimer.md
 
 

Repository files navigation

Fall 2025 Textbook

This is the Fall 2025 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

No description, website, or topics provided.

Resources

Readme
Activity
Custom properties

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •