Start theTreesapplet

. 2 The purpose of this exercise is to build a binary search tree but choosing different orders for inserting the nodes.

3 Type in the following flower names in the given order. Take a screenshot when done. Aster Bluebell Coreopsis Daisy Echinacea Fern Gladiolus

4 What does your tree look like? Describe it in words below.

5 What generalization can you make about inserting elements from a sorted list into a binary search tree?

6 Clear the tree and insert the flowers in some other order so that the tree is more balanced .Take a screenshot. Also write down the exact order that you used to get it to look this way

. 7 Is there more than one order that you could have used that would have created the more balanced tree ? If so, why are multiple different tree shapes possible