QUESTION 3 (Binary Trees) ========
(5 marks)
a) Create an AVL tree by inserting the below given values one at a time. Check its balance after every
insertion. Apply rotation operation(s), if necessary.
Your_own_reg#, 84, 8, 50, 74, 12
b) Create a Min Heap tree by inserting the below given values one at a time.
Your_own_reg#, 84, 8, 50, 74, 12