This is data Structure question, of binary search tree. I want this question to be performed on paper with appropriate BST diagram of following question asked.

Consider the BST B = 19, 18, 17, 16, 15, 14, 13, 12, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1 and,

• Exhibit making of AVL Tree
• Exhibit making of Red-Black Tree

This must be performed in writing and with discription, these are two parts of question. I have wasted 1 question because his answer is not complete.