Graphy — Interactive Recursion Tree Visualizer & Call Stack Simulator

A visual way to understand recursion, because keeping 12 function calls in your head was never a good idea.

Dry-Run Recursion and LeetCode Binary Trees Visually

Graphy is a client-side recursion debugger and call stack simulator. Paste recursive functions in C++, Python, or Java to generate interactive chalkboard recursion trees, trace memory stack frames, and inspect base cases and return values in real-time.

  • Zero Server Latency: 100% client-side transpilation and sandboxed execution in the browser.
  • LeetCode Tree Support: Automatically converts level-order arrays (e.g. [1, 2, 3]) into TreeNode pointers with side-by-side visualizers.
  • Directional Call & Return Arcs: Solid teal arrows indicate forward function calls; dashed purple arcs reveal returned values during stack unwinding.
  • Step-by-Step Simulation: Interactive timeline controls with active code line synchronization.

Frequently Asked Questions

How does Graphy trace recursion without sending code to a server?

Graphy runs an in-browser transpilation and AST instrumentation engine that converts C++, Python, and Java into a sandboxed execution runtime with 0ms network latency. Your code and interview solutions never leave your browser.

Does Graphy support LeetCode binary tree problems (TreeNode)?

Yes. Graphy includes a built-in tree parser that automatically converts LeetCode level-order arrays like [1, 2, 3, null, 4] into pointer-linked TreeNode structures with a live interactive Dual Tree visualizer.

Which programming languages are supported?

Graphy natively supports C++, Python, and Java with automatic language detection, handling classes, helper functions, vector/list collections, and pointers.