# CS61B Guide

## CS61B Guide

- [This site is now deprecated](https://cs61b.bencuan.me/readme.md)
- [Inheritance](https://cs61b.bencuan.me/oop/inheritance.md)
- [Access Control](https://cs61b.bencuan.me/oop/access-control.md)
- [Dynamic Method Selection](https://cs61b.bencuan.me/oop/dynamic-method-selection.md): ft. Doge and RarePupper
- [Java Objects](https://cs61b.bencuan.me/oop/objects.md)
- [Generic Types](https://cs61b.bencuan.me/oop/generics.md)
- [Asymptotic Analysis Basics](https://cs61b.bencuan.me/asymptotics/asymptotics.md)
- [Amortization](https://cs61b.bencuan.me/asymptotics/amortization.md)
- [Asymptotics Practice](https://cs61b.bencuan.me/asymptotics/asymptotics-practice.md)
- [Collections](https://cs61b.bencuan.me/abstract-data-types/collections.md)
- [Arrays](https://cs61b.bencuan.me/abstract-data-types/collections/arrays.md)
- [Linked Lists](https://cs61b.bencuan.me/abstract-data-types/collections/linked-lists.md)
- [Sets](https://cs61b.bencuan.me/abstract-data-types/collections/sets.md)
- [Stacks and Queues](https://cs61b.bencuan.me/abstract-data-types/collections/stacks-and-queues.md)
- [Binary Trees](https://cs61b.bencuan.me/abstract-data-types/binary-trees.md)
- [Heaps](https://cs61b.bencuan.me/abstract-data-types/binary-trees/heaps.md)
- [Balanced BSTs](https://cs61b.bencuan.me/abstract-data-types/binary-trees/balanced-search-structures.md)
- [Tries](https://cs61b.bencuan.me/abstract-data-types/binary-trees/tries.md)
- [Graphs](https://cs61b.bencuan.me/abstract-data-types/graphs.md)
- [Hashing and Hash Tables](https://cs61b.bencuan.me/abstract-data-types/hashing.md)
- [Union Find (Disjoint Sets)](https://cs61b.bencuan.me/abstract-data-types/union-find-disjoint-sets.md)
- [Comparables and Comparators](https://cs61b.bencuan.me/abstract-data-types/comparables-and-comparators.md)
- [Sorting](https://cs61b.bencuan.me/sorting/sorting-basics.md)
- [Minimax Algorithm](https://cs61b.bencuan.me/algorithms/minimax.md)
- [Searching](https://cs61b.bencuan.me/algorithms/searching.md)
- [Binary Search](https://cs61b.bencuan.me/algorithms/searching/binary-search.md)
- [Depth First Search (DFS)](https://cs61b.bencuan.me/algorithms/searching/depth-first-search-dfs.md)
- [Breadth First Search (BFS)](https://cs61b.bencuan.me/algorithms/searching/breadth-first-search-bfs.md)
- [Shortest Paths](https://cs61b.bencuan.me/algorithms/shortest-paths.md)
- [Dijkstra's Algorithm](https://cs61b.bencuan.me/algorithms/shortest-paths/dijkstras-algorithm.md): Special thanks to Arin for writing this page!
- [A\* Search](https://cs61b.bencuan.me/algorithms/shortest-paths/a-search.md): Special thanks to Arin for writing this page!
- [Minimum Spanning Trees](https://cs61b.bencuan.me/algorithms/minimum-spanning-trees.md): Special thanks to Arin for writing this page!
- [Prim's Algorithm](https://cs61b.bencuan.me/algorithms/minimum-spanning-trees/prims-algorithm.md): Special thanks to Arin for writing this page!
- [Kruskal's Algorithm](https://cs61b.bencuan.me/algorithms/minimum-spanning-trees/kruskals-algorithm.md): Special thanks to Arin for writing this page!
- [Modular Arithmetic and Bit Manipulation](https://cs61b.bencuan.me/misc-topics/modular-arithmetic.md)
- [Exceptions](https://cs61b.bencuan.me/misc-topics/exceptions.md)
- [More Resources](https://cs61b.bencuan.me/misc-topics/more-resources.md)