![2) (a) [8%] Insert the following numbers into an initially empty AVL tree one by one. Show the resulting tree after each inse](https://media.cheggcdn.com/media%2F1a0%2F1a039fae-bd31-4a32-8a65-913f089f43c9%2FphpfwJx51.png)
![(c) [596] If we modify the definition ofAVL tree as follows. A modified-AVL tree is a binary search tree such that for every](https://media.cheggcdn.com/media%2Ffe1%2Ffe1dcd04-a923-4af2-834f-f77b961d98c6%2FphpkEQX6l.png)
2) (a) [8%] Insert the following numbers into an initially empty AVL tree one by one. Show the resulting tree after each insertion (including the “balanced factor” using the notation in the lecture slide). Then, delete 115, 138. Show also the resulting tree (with the balance factor) after
OR
OR