2.
Draw the binary search tree that results when you insert the keys
N O T D U E T I L M A R C H in that order into an initially empty
tree, using the root insertion method.
3.
Draw the 2-3-4 tree that results when you perform top-down insertion of the
keys N O T D U E T I L M A R C H in that order into an initially
empty tree.
4.
Draw the red-black tree that results when you perform top-down insertion of the
keys N O T D U E T I L M A R C H in that order into an initially
empty tree.
5.
Draw the splay tree that results when you insert the keys
N O T D U E T I L M A R C H in that order into an initially empty
tree.