In this assignment you will repeat Homework $01$ steps on an AVL tree.

You need to define the AVL ADT, then work out pseudocode for find, insert, delete.

Note than an AVL tree is a BST that re$-$balances itself $($like Splay trees or Red$-$Black trees$).$

Interactively construct AVL trees here: start with an empty BST

insert $($in order$)9,2,1,10,8,3,7,4,6,5$

then delete $9$ and then insert it again in the tree

and finally delete the root two more times in a row

Please show the tree after every insertion and explain briefly how that works.

Please also explain how the tree changes when you delete $9.$