CS61B Data Structures (Hillfinger) - 2021 Fall
Those are note archives as well as very well-structured final review docs I made for my self. I put it here so that you can study it and also I will be able to review it later. So if you found this useful, make sure you star my repo
Resource List
- Final Review Doc
- Midterm 2 Cheetsheet
- Annotated Lectures
- Lec 14 - Integers
- Lec 16 - Complexity
- Lec 17 - Collection / List & Amortized Time
- Lec 18 - Views / Maps / Array vs. Linked / Sentinels / Stack / Queue/ Deque / Recursion and Stacks
- Lec 20 - Trees
- Lec 21 - Tree Searching
- Lec 22 - Hashing
- Lec 23 - Game Trees
- Lec 24 - Priority Queues
- Lec 25 - Java Generics
- Lec 26 - Sorting(Insertion + Inversion + Heap Sort)
- Lec 27 - Sorting(Merge + Quick)
- Lec 28 - Counting + Radix Sort
- Lec 29 - BST & Red-Black Tree
- Lec 31 - More on BST
- Lec 32 - GIT
- Lec 33 - Graph + Dijkstra Shortest Path
- Lec 34 - A* Search(Shortest Path), Minimum Spanning Tree(Prim’s & Kruskal’s Algorithm)
- Lec 35 - Pseudo Random Sequence
- Lec 36 - Dynamic Programming(DP)
- Lec 37 - Threads, Coroutines & Storage Management
- Lec 39 - Compression(Shannon-Fano / Huffman / LZW)
- Lec 40 - Summary
- Video Links