This is the Data Structures course and you are to create five tree drawings

This is the Data Structures course and you are to create five tree drawings. Can be hand drawn trees.

The phrase “binary search tree” with no qualifiers means a BST that does not self-balance.

You are given the sequence of words:

if
you
wish
to
make
apple
pie
from
scratch
one
must
first
invent
the
universe
Provide a drawing of the binary search tree that would result from inserting these words in the order given.
Provide a drawing of the binary search tree that would result from inserting these words in ascending order.
Provide a drawing of the AVL binary search tree that would result from inserting these words in the order given. Label each node with its height as defined in class.
Provide a drawing of the AVL binary search tree that would result from inserting these words in ascending order. Label each node with its height as defined in class.
List the words in median order, that is, the first word is the median of the list. This divides the list into two sub-lists, one with the words less than the median and one with words that are greater. The next word to list is the median of the first sub-list and the one after is the median of the second sub-list. Repeat this until all of the words are listed.
Provide a drawing of the binary search tree resulting from inserting the words in that median ordering.