CS61B Data Structures

CS61B Data structures

Below contains a comprehensive list of data structures and algorithms covered by the Spring 2025 offering of CS61B.

Data Structures

Primitive & Sequential Structures

• Arrays
• SLLists
• DLLists
• ArrayList

Disjoint-Sets

• Weighted Quick Union
• Weighted Quick Union with Path Compression

Maps and Sets

• TreeMap
• HashMap

Trees

• Binary Search Tree
• B-Tree
• Left-leaning Red Black Tree
• Trie

Heaps and Priority Queues

• Binary Heap

Graph Representations

Algorithms:

Asymptotic Analysis

• Big-O, Big-Θ, Big-Ω
• Amortized analysis

Comparison Based Sorting

• SelectionSort
• InsertionSort
• MergeSort
• QuickSort

Non-Comparison Based Sorting

• Counting Sort
• Radix Sort

Traversals and Graph Problems

• Depth-First Search
• Breadth-First Search
• Shortest Paths
• Minimum Spanning Trees
• Directed Acyclic Graphs