Question 10 of 27
/2 marks
Insert nine nodes with key values ALGORITHM (in this order) into an initially empty AVL tree. Do a postorder traversal of the
nodes. The sequence of key values obtained by the postorder traversal is
a. M, H, T, I, R, O, G, L, A
b. L, G, R, A, I, O, T, H, M
c. L, G, A, I, H, R, O, M, T
d. A, L, G, O, R, I, T, H, M
e. A, H, I, G, M, O, T, R, L
f. A, G, H, I, L, M, O, R, T
Save Answer
