Is there any way to implement a nonrecursive preorder traversal of a binary tree without using a stack? In a standalone function?the recursive preorder ...

I don't mean to be nitpicky, but couldn't you just use a slightly modified binary tree algorithm?<P>I mean, the idea behind threaded binary trees (and correct me if I'm wrong) is that traversal is ...