title: Traversing a n-ary tree without using recurrsion
body: <p>How can I traverse an <code>n</code>-ary tree without using recursion?</p>
  
  <p>Recursive way:</p>
  
  <pre><code>traverse(Node node)
  {
      if(node == null)
          return;
  
      for(Node child : node.getChilds()) {
          traverse(child);
      }
  }
  </code></pre>