We consider this sequence of elements:

$20,10,15$: Display the tree $($per level$)$ before and after the necessary rotations to make this tree balanced

$10,5,1$: Display the tree $($per level$)$ before and after the necessary rotations to make this tree balanced

$10,20,30$: Display the tree $($per level$)$ before and after the necessary rotations to make this tree balanced

$10,20,50$: Display the tree $($per level$)$ before and after the necessary rotations to make this tree balanced

Code to be submitted: Question $5$ only. The code should run and display the $4$ cases in the $2$ conditions: before$/$after the necessary rotations that should be determined automatically based on the balance between the right and left subtrees. code in c$++$