1) Start with an empty binary search tree, and insert each of these values in the order shown: 50, 75, 25, 40, 10, 90, 60, 80, 30, 70, 20. Draw the binary search tree after the final insert.

2) Write the nodes of the above BST in the order they are visited by each of these traversals:

Inorder:

Preorder:

Postorder:

3) Remove each of these values in the order shown: 10, 90, 50. Re-draw the binary search tree after completing these remove operations.