Show by example that a single erase operation in an AVL tree may require (n)trinode restructurings (or rotations) to restore the height-balance property. Draw a schematic of an AVL tree for which this is the case; explain your answer.

Write a program that reads a set of floating-point values. ask the user to enter the values, then print • the average of the values. • the smallest of the values. • the largest of the values. • the range, that is the difference between the smallest and largest. of course, you may only prompt for the values once.