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

Binary tree is one of the most important data structures in the programming world. The basic definition can be given as follows (as mentioned in one of the data structures book by Tenenbaum).