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
Object Orientation Stack vs Heap
Eliminate aliasing bugs by visualizing Java's Stack vs Heap memory. See how references map to object instances and primitives copy by value.
Heapsort Visualization
Visualize treating a flat array as a Complete Binary Tree. Watch the algorithm Build Max Heap, then extract elements to sort in O(N log N) time without extra memory.
Array & ArrayList Operations
Recursion Call Stack Memory
Step through factorial and Fibonacci recursive calls frame-by-frame. Watch the LIFO Call Stack grow and trace return values bubbling up from the Base Case.
Stack & Queue
Sorting Algorithms O(N^2) vs O(N log N)
Visualize Selection, Insertion, and Merge sort line-by-line. Track memory accesses, array swaps, and Big-O efficiency in real time.
Recursion Visualizer
Inheritance & Polymorphism
Recursive Fibonacci Call Tree
Visualize how a single recursive method spawns a massive Call Tree of overlapping sub-problems. Observe exponential O(2^n) inefficiency.