title: Iterative octree traversal
body: <p>I am not able to figure out the procedure for iterative octree traversal though I have tried approaching it in the way of binary tree traversal. For my problem, I have octree nodes having child and parent pointers and I would like to iterate and only store the leaf nodes in the stack. 
  Also, is going for iterative traversal faster than recursive traversal?</p>