Question 1.
Describe an algorithm for using binary search tree to
sort an array of integers in increasing order.
Perform the algorithm with input array: 30, 40, 24, 58, 48, 26, 11, 13.
Question 2.
Describe steps to insert following keys into an empty-
AVLtree: 5, 2, 1, 6, 8, 3, 4.
Delete keys from the final AVLtree according to the inserted
order.
Repeat above questions for a (2, 4) tree .
Question 3.
Describe an algorithm in pseudo code to rebalance an
unbalanced node in an AVL Tree.