Need help answering #1 for my discrete mathematics course.

A. Set up a binary search tree for the following list, using alphabetical ordering: TENT, SOAP, YES, WATCH, LOST, SUN, APPLE, ORANGE. Show every step of the construction of binary search tree. b. Explain step by step how you would search for the word ZEBRA in your tree. c. What is the height of the shortest binary search tree that can hold all 16 words? d. Write the preorder traversal of the tree. e. Write the postorder traversal of the tree. f. Write the inorder traversal of the tree