Consider the binary search tree in Figure 15-20 . The numbers simply label the nodes so that you can reference them; they do not indicate the contents of the nodes.
a. Without performing an inorder traversal, which node must contain the value that comes immediately after the value in the root? Explain.
b. In what order will an inorder traversal visit the nodes of this tree? Indicate this order by listing the labels of the nodes in the order that they are visited.