:         I am looking for a way to do an ionorder traversal of a Binary Search
: Tree (BST), _non-recursively_. I have a pointer implementation of a BST, and
: although it is easy to implement with recursion, I am having a hard time
: doing it non-recursively...

I think if you add a few additional pointers and turn your tree into
a threaded tree you can easily traverse it iteratively.  

I did write a code for threaded tree some years ago -- I'll post it
if I can find it without too much work.