Subject is :-Data Structure And algorithmic

Give the detail answer of all question and neat please.

Question 2 (5+5) a. (1). Make BST of the following sequence and Traverse tree in all type of traversals. 98, 100, 102, 117, 2, 19, 89, 76, 12, 34, 27, 58, 90, 98, 13 (ii) Calculate Number of nodes at this and Previous level from above tree. (iii) What would be the degree, height, depth and Level of the tree. (iv). Identify the terminal nodes and Predecessor of Node 117. b. (1). Write a code, how to insert above elements in a tree. (ii). What would be AVL after deleting 2 using in order successor case