For each of the following lists, construct an avl tree by inserting their elements successively, starting with the empty tree.
a) 1, 2, 4, 5, 3, 6
b) 1, 2, 6, 3, 4, 5