Consider a binary tree that is threaded to facilitate in order traversal.
Give an algorithm for finding the preorder successor of a given node in such an injured rethreaded binary tree.
Do not rethread the tree to facilitate preorder traversal as described in Exercise .
Exercise ,
Give an algorithm similar to that in the text for threading a binary tree, but to facilitate preorder traversal.