Knowledge
Binary Search Tree
A comparison-based tree offering logarithmic operations when balanced, and linear ones when not.
QuickUnion
A near-constant time solution to dynamic connectivity using weighted trees and path compression.
PriorityQueue
A queue optimized for fast access to the highest-priority element.
ArrayList
Classical data structure that is often fast, until it isn't.
Stack
Last In, First Out, simple as that.
UnionFind
A different view on the dynamic connectivity problem through the lens of Quick-Find.
Queue
A practical application of a linked list which shines in scenarios requiring FIFO ordering.
Singly Linked List
The gateway to understanding linked data structures.
Bubble Sort
A quadratic-time algorithm that’s only useful as a teaching tool — but still has a few subtle properties.
Insertion Sort
A simple O(n²) sorting algorithm that is surprisingly fast on small or nearly sorted arrays.