Problem:
Question: Part 1- Show an AVL tree of height 5 with minimum number of nodes. Use keys 1, 2, ..., n (n should be minimized).
Part 2- Find the key x of a node at depth 5. Insert x + 0.5 into the tree.
Step by step instructions so I can understand would be greatly appreciated!