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 ...