I am implementing a binary search tree, and using non-recursive techniques in most of the algorithms. I think I finally have my deletion down, and considered several forms of a tree when a node is deleted that may cause problems for the non-recursive solutions. The one thing I'm having trouble with is non-recursive traversals (in-order, post-order, pre-order). Is it practical to devise a non-recursive algorithm for such functions. Also, is my delete function missing anything? I'm trying to get this down pat before I move on to R/B trees or AVL trees.