Binary Search Tree 15 12 7 37 4 29 Figure 2: Binary Search Tree of 10 Nodes A: Using pre-order traversal, what is the sixth number of the ouput? B: Using post-order traversal, what is the sixth number of the ouput? C: Assume the insertion function is correct. If 9, 20, 25, and 1 are inserted (in this order) into the binary search tree shown in Figure 2, what is the tenth number of the output when using pre-order traversal? D: Assume the insertion function is correct. If 9, 20, 25, and 1 are inserted (in this order) into the binary search tree shown in Figure 2, what is the tenth number of the output when using post-order traversal