Draw the binary search tree that results when the keys A L G O R I T H M are inserted into an initially empty tree.

Draw the 2-3-4 tree that results when the keys A L G O R I T H M are inserted into an initially empty tree. Next, draw the red black tree that results when the same keys are again inserted into an empty tree.

Due at precept on March 20/21.