Proceeding as in Exercise 1, give an algorithm for carrying out a preorder traversal of an in order-threaded binary tree.
Exercise 1,
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 2.
Exercise 2,
Give an algorithm similar to that in the text for threading a binary tree, but to facilitate preorder traversal.