Proceed as in Exercise , but write a no recursive function.
Exercise ,
Deal with fully-threaded BSTs, in which not only are null right links replaced with threads to in order successors, as described in the text, but also null left links are replaced with threads to in order predecessors.