# Question: note provide the answers with 7 diagrams not the...

###### Question details

**Note*** : Provide the answers with 7 diagrams,
not the final tree diagram. point 1 should be an unbalanced binary
search tree.

**1. Draw binary search trees :**

You are to draw the **possibly unbalanced binary search
trees** that result after inserting each of the following
keys in the order given: 62, 50, 25, 75, 100, 37, 43. **You
will draw a total of 7 trees, one after each
insertion**.

**2. Draw AVL trees :**

You are to draw the AVL trees that result after inserting each
of the following keys in the order given: 62, 50, 25, 75, 100, 37,
43. **You will draw a total of 7 trees, one after each
insertion**.