Assignment Instructions:

The objective of this assignment is to demonstrate the process of inserting elements into

self$-$balancing trees, specifically AVL and Red$-$Black Trees. Insert a set of elements into both

AVL and red$-$black trees, documenting all step$-$by$-$step operations and highlighting the balancing

mechanisms employed in each tree type.

Ensure that your submissions demonstrate a clear understanding of the insertion operations in

both AVL and red$-$black trees. Pay attention to the step$-$by$-$step operations and provide visual

aids to enhance understanding.

Questions:

Insert the following elements in an AVL tree: $13,7,9.12,5,2,1,8$