a. Insert the values 29, 3, 17, 9, 48, 26, 1, 42, and 5 into an initially empty binary search tree. The elements must be inserted in the given order.

b. List the nodes of the above binary search tree in the pre-order traversal.

c. List the nodes of the above binary search tree in the in-order traversal.

d. List the nodes of the above binary search tree in the post-order traversal.