Question- Consider the subsequent list of elements:
15 10 9 25 19 56 78 12 14 12 11
- First insert them sequentially into a binary search tree.
- Next reinsert them into an empty AVL tree, restoring the AVL property after each insertion. Show the AVL tree which results after each insertion.
- Give and compare the heights of the two trees.
Is there anybody who knows how to do this? Please give a detailed answer so that I may learn from it. Thank you!