What will be true about the results of an inorder traversal of a binary search tree?
For each of the next four problems, draw the binary search tree that would result if the given elements were added to an empty binary search tree in the given order. Then write the elements of the tree in the order that they would be visited by each kind of traversal (preorder, inorder, and postorder).