java problem:

Show the result of every step of inserting the following sequence of elements into an initially empty AVL-tree: 10, 20, 15, 25, 30, 16, 18, 19.

Show the resulting AVL-tree, after physical deletion (NOT a lazy deletion) of the record with the key 30 from the AVL tree that you got in the previous part.

Important Notes:

For this problem, you dont need to submit any implementation in Java.

For all parts of this problem, you must draw the AVL-trees using the appropriate graphics tools at your convenience.