AP COMPUTER SCIENCE A

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.

3,800 views

AP COMPUTER SCIENCE A

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.

2,600 views

AP COMPUTER SCIENCE A

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.

0 views