Uses tree with parent pointer to find the leafs in a iterative way without stack. Incomplete implementation of inplace traversal of the BST.
The real world traversal without recursion is the Morris traversal: https://en.wikipedia.org/wiki/Threaded_binary_tree