Suppose the following values are inserted into a binary tree, in the order given: 12, 7, 9, 10, 22, 24, 30, 18, 3, 14, 20 A.) Draw a diagram of the resulting binary tree.

B.) How would the values in the tree you sketched be displayed in an inorder traversal?

C.) How would the values in the tree you sketched be displayed in a preorder traversal?

D.) How would the values in the tree you sketched for Question 17 be displayed in a postorder traversal?