#1 Create two AVL trees with 7 keys: A, B, C, D, E, F, and G.(There are 5,040 different key sequences that produce 429 uniquetrees. Of those trees, 17 are AVL trees.)
a. Draw the shortest AVL tree containing these 7 keys.
b. Draw one of the tallest possible AVL trees containing these 7keys.
Answer
If we consider the ascii values of the nodes then the treeare:
ud orth a Unu RS7T) Oh – key. We were unable to transcribe this imageAG,Go,E,F and A,B,C