Skip to content
brandonwie.dev
~ / study

Study

A public study shelf for material I have actually worked through.

The first section turns my Georgia Tech DSA I notes into inspectable, interactive examples — visual demos plus quick recall prompts to keep the material in long-term memory.

#

current courses

active notes

Data Structures & Algorithms I

2026-06-18

ArrayLists, LinkedLists, stacks, queues, recursion, binary search, iterators, comparators, and Big-O from the DSA I study folder.

Big-O scalingArray-backed listsRecursive tracesPointer updates
Module 0
Module 1
Module 2
Module 3

Modules 0–3 · 5 interactive demos

active notes

Data Structures & Algorithms II

2026-06-19

Binary search trees and traversals, BST removal, SkipLists, binary heaps and priority queues, and HashMaps with collisions and load factor, from the DSA II study folder.

BST traversalsBST removalHeap siftHash collisions
Module 4
Module 5
Module 6
Module 7

Modules 4-7 · 4 interactive demos

fresh notes

Data Structures & Algorithms III

2026-07-06

AVL trees and rotations, (2,4) trees with splits and fusions, iterative sorts, and the divide-and-conquer sorts (merge, quicksort, LSD radix, and quickselect), from the DSA III study folder.

AVL rotations(2,4) tree splitsSort trade-offsQuickselect
Module 8
Module 9
Module 10
Module 11

Modules 8-11 · 4 interactive demos

  • /Visual demos you can step through
  • /A module roadmap for each course
  • /Quick self-check prompts to fight forgetting
enko