If the keys '1, 2, 3, 4 and 5' are inserted in order into initially empty a AVL tree, the root node is
Reveal answer
Fill a bubble to check yourself
If the keys '1, 2, 3, 4 and 5' are inserted in order into initially empty a AVL tree, the root node is