Perform the following questions.
Question 1) Write a non recursive function to insert the node in AVL tree.
Question 2) Write a non recursive function to delete a node from an AVL tree.
Question 3) Write a recursive function to delete node from the AVL tree.
Question 4) Write a function to merge the nodes of two AVL trees to obtain a new AVL tree.
Question 5) Write a functions to determine the immediate predecessor and immediate successor of a given key value in a B-tree.
Question 6) Write a function to insert new key to a B-tree of order “m”.
Question 7) Write a function to delete the existing key from a B-tree of order “m”.
Question 8) Write a program to divide unsigned number by another number using bitwise operators.
Question 9) Write a program for Hanoi problem.