Really need help with this! Thank you so much!

Exercise 1 List the elements of the following binary tree in pre-order, in-order and post-order traversals: F) (E D Exercise 2: Consider insertion of the following sequence of integers into an empty AVL Tree: 1 2 3 4 5 6 7 9 8 Notice that 9 precede 8 in the input sequence!) Draw the corresponding AVL Tree after the completion of each insertion that requires a well as after the second rotation. Exercise 3 Draw the AVL tree that would result after deleting V and then deleting F from the following AVL tree