DSA Recursive Functions Visualizer

Pick an example and step through it call by call: frames push onto and pop off the call stack while the call tree grows below — click any tree node for its details.

is_palindrome('level') — 4 calls, at most 4 frames on the stack.

Python source

Loading the editor...

Call stack

No frames on the stack.

0 frames on the stack · this run peaks at 4.

Call tree

No calls yet — step forward to grow the tree.

Text version of the tree so far
(no calls yet)
step 0 / 8

Ready to run is_palindrome('level') — step forward to make the first call.