Stack & Queue

Binary Search Tree

Construct dynamic 2D Binary Search Trees element by element. Run animated depth-first traversals (In-order, Pre-order, Post-order) stepping through the recursive call stack.

Array vs ArrayList Memory Resizing

Witness the internal array backing an ArrayList dynamically resize. Compare fixed memory bounds against O(N) copy operations when capacity is exceeded.

2D Array Traversal

Deconstruct nested loops covering Row-Major, Column-Major, and boundary tracing across a 2D integer matrix.

Big-O Complexity