title: Understanding of a C code required
body: <pre><code>int Size(struct node* node)
  {
     if(node == NULL)
     {
        return 0;
     }
     else if(node != NULL)
     {
        return (Size(node-&gt;left) + 1 + Size(node-&gt;right));
     }
  }
  </code></pre>
  
  <p>Hi, can anybody please post the stack trace for the following piece of code. </p>
  
  <p>Lets say if we insert the values 2, 1, 10, 5... 
  Then what could be the stack representation during the recursion process.. Please, its very urgent, and its very confusing too...</p>