a) Given sequence of elements [9, 7, 5, 11, 12, 2, 14, 3, 10, 6, 11, 2,4]
(a) Create a min -heap with the elements.
(b) Write the inorder, preorder, post order traversal of the binary tree
obtained.
(c) Add elements 4, 10, 7 in order in the heap.
(d) Remove 2, 3, 5 from the heap
(e) Sort the list using heap sort (max-heap).
b) Add the same sequence to an Binary Search Tree.
c) Add the sequence to an AVL tree.
d) Add the sequence to a 2-3-4 Tree and convert it to a red-black tree.