<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Subhash Rawat</title>
    <description>The latest articles on DEV Community by Subhash Rawat (@subhash_rawat_bceff7b581e).</description>
    <link>https://dev.to/subhash_rawat_bceff7b581e</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3487522%2Fc458d404-8031-453d-b915-21568fe4dcc2.png</url>
      <title>DEV Community: Subhash Rawat</title>
      <link>https://dev.to/subhash_rawat_bceff7b581e</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/subhash_rawat_bceff7b581e"/>
    <language>en</language>
    <item>
      <title>I Built a Recursion Visualizer Because I Was Tired of Drawing Trees on Paper</title>
      <dc:creator>Subhash Rawat</dc:creator>
      <pubDate>Sun, 19 Jul 2026 21:48:20 +0000</pubDate>
      <link>https://dev.to/subhash_rawat_bceff7b581e/i-built-a-recursion-visualizer-because-i-was-tired-of-drawing-trees-on-paper-5603</link>
      <guid>https://dev.to/subhash_rawat_bceff7b581e/i-built-a-recursion-visualizer-because-i-was-tired-of-drawing-trees-on-paper-5603</guid>
      <description>&lt;p&gt;If you've prepared for coding interviews, you've probably done this before.&lt;/p&gt;

&lt;p&gt;You write a recursive function, grab a notebook, and start drawing the recursion tree by hand. Then you sketch the call stack beside it. A few arrows later you're trying to figure out which function call is returning and which one is still waiting.&lt;/p&gt;

&lt;p&gt;I did this for almost every recursion problem I solved.&lt;/p&gt;

&lt;p&gt;It worked, but it wasn't exactly fun.&lt;/p&gt;

&lt;p&gt;The problem&lt;/p&gt;

&lt;p&gt;Recursion is one of those topics that looks simple until you have to trace it.&lt;/p&gt;

&lt;p&gt;The code is usually short.&lt;/p&gt;

&lt;p&gt;The execution isn't.&lt;/p&gt;

&lt;p&gt;Once there are multiple recursive calls, different local variables, return values flowing back up, and maybe memoization on top of that, everything becomes much harder to follow.&lt;/p&gt;

&lt;p&gt;During interview preparation I looked for tools that could help visualize recursion.&lt;/p&gt;

&lt;p&gt;I found several.&lt;/p&gt;

&lt;p&gt;Some showed a recursion tree.&lt;/p&gt;

&lt;p&gt;Some animated a fixed example.&lt;/p&gt;

&lt;p&gt;Some displayed the call stack.&lt;/p&gt;

&lt;p&gt;But I couldn't find one that combined everything in one place while letting me run my own code.&lt;/p&gt;

&lt;p&gt;That became my weekend project.&lt;/p&gt;

&lt;p&gt;Building RecurSee&lt;/p&gt;

&lt;p&gt;I built RecurSee, an interactive recursion visualizer that lets you write recursive code and watch it execute step by step.&lt;/p&gt;

&lt;p&gt;It currently supports:&lt;/p&gt;

&lt;p&gt;Java&lt;br&gt;
Python&lt;br&gt;
JavaScript&lt;/p&gt;

&lt;p&gt;Instead of reading static code and mentally simulating execution, you can watch:&lt;/p&gt;

&lt;p&gt;the recursion tree grow&lt;br&gt;
the call stack change&lt;br&gt;
variables update&lt;br&gt;
base cases execute&lt;br&gt;
return values propagate back up&lt;br&gt;
execution move one step at a time using a timeline&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Fzrwu4hrq59cogon1ivd0.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Fzrwu4hrq59cogon1ivd0.png" alt="The first version of RecurSee. I wanted everything needed to understand a recursive function in one place instead of switching between code, notes, and a debugger." width="800" height="393"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;The hardest part&lt;/p&gt;

&lt;p&gt;I expected rendering the recursion tree to be the difficult part.&lt;/p&gt;

&lt;p&gt;It wasn't.&lt;/p&gt;

&lt;p&gt;Keeping everything synchronized was.&lt;/p&gt;

&lt;p&gt;When execution moves to the next step, the highlighted node, call stack, variables, and return values all need to update together.&lt;/p&gt;

&lt;p&gt;If even one of them is out of sync, the visualization becomes confusing instead of useful.&lt;/p&gt;

&lt;p&gt;Variable tracking was another unexpected challenge. Small UI decisions made a much bigger difference than I anticipated.&lt;/p&gt;

&lt;p&gt;Visualizing memoization&lt;/p&gt;

&lt;p&gt;One feature I wanted from the beginning was showing where memoization actually helps.&lt;/p&gt;

&lt;p&gt;When people first learn dynamic programming, they're often told:&lt;/p&gt;

&lt;p&gt;"Store previous results."&lt;/p&gt;

&lt;p&gt;That's easy to say.&lt;/p&gt;

&lt;p&gt;It's much easier to understand when you can actually see the same subproblem appearing multiple times in the recursion tree.&lt;/p&gt;

&lt;p&gt;Watching repeated branches appear makes the motivation behind memoization much more obvious than reading about it.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Ffl260ivtgagq1ftjpvd2.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2Ffl260ivtgagq1ftjpvd2.png" alt="Comparing two executions made it much easier to spot repeated work and understand where memoization actually helps." width="800" height="393"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Stepping through execution&lt;/p&gt;

&lt;p&gt;One feature I use the most is the timeline.&lt;/p&gt;

&lt;p&gt;Instead of replaying the entire execution, I can move forward or backward one step at a time and inspect exactly what's happening.&lt;/p&gt;

&lt;p&gt;That turned out to be much more useful than I expected, especially while debugging.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2F3ttmuhuwjhwuy83v7je1.gif" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Farticles%2F3ttmuhuwjhwuy83v7je1.gif" alt="Watching a recursive function execute one step at a time. The active call, stack, variables, and return values stay synchronized throughout execution." width="318" height="156"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Current limitations&lt;/p&gt;

&lt;p&gt;Very large inputs create very large recursion trees.&lt;/p&gt;

&lt;p&gt;That's expected, and there are practical limits to how much can be displayed while keeping the visualization responsive.&lt;/p&gt;

&lt;p&gt;For learning recursion, debugging recursive functions, and interview preparation though, it has worked well.&lt;/p&gt;

&lt;p&gt;Final thoughts&lt;/p&gt;

&lt;p&gt;I built this primarily because I wanted it myself.&lt;/p&gt;

&lt;p&gt;I wanted a tool that showed what the runtime is actually doing instead of forcing me to imagine it.&lt;/p&gt;

&lt;p&gt;If you're learning recursion, preparing for coding interviews, or teaching recursive algorithms, I'd love to know what features you'd find useful.&lt;/p&gt;

&lt;p&gt;You can check it out at &lt;a href="https://recursee.com" rel="noopener noreferrer"&gt;Recursee&lt;/a&gt; if you're curious.&lt;/p&gt;

&lt;p&gt;I'm also open to feedback there's still plenty I'd like to improve.&lt;/p&gt;

</description>
    </item>
  </channel>
</rss>
