title: non-recursive Iterator for Binary search tree
body: <p>I have a main.c file similar to this:</p>
  
  <pre><code>it = bet_create_iterator(bstree);
  
  while ((n = bst_iter_next(it))) {
      printf("value: %d", bst_getvalue(n));
  }
  </code></pre>
  
  <p>I hope you can see from the above how its used. Heres my problem though. its that function,     </p>
  
  <pre><code>bst_iter_next(it)
  </code></pre>
  
  <p>it returns a pointer to a node in the tree.</p>
  
  <p>I find it really simple to traverse a BST recursively but doing it this way, returning a node each time is proving difficult.</p>
  
  <p>If someone could help a guy out and explain to me how to do it it would be much appreciated.</p>
  
  <p>Cheers,</p>
  
  <p>Andy.</p>