Consider the problem of in-order traversals of binary trees. We have seen one way to perform them: recursively, from the top of the tree. Another is to be able to identify, for each node, which node...

Extracted text: Consider the problem of in-order traversals of binary trees. We have seen one way to perform them: recursively, from the top of the tree. Another is to be able to identify, for each node, which node of the tree would follow it in an in-order traversal. Describe, using standard tree terminology, how you would reliably find the "next" after any arbitrary node in a binary tree. Indicate what you would need to know about the current node and how to navigate the tree to get to the next-in-order. You do not need to write code for this problem.