please do asap three parts of a single question c++

three different statements are the diff parts of a question

Implement following functions recursively: a) Form a Binary Search Tree by inserting 20,10,5,17,15,19,18,3,30,40,45,35,37,31,28,26 in the given order. b) Delete 40, 30, 17 and 10 from the Binary Search tree formed in part (a) above. Given the following In-Order and Post-Order traversals of a binary tree, construct the tree. In-Order: 1 2 3 4 5 6 7 8 9 10 Post-Order: 1354 2 7 10 9 86 Write the code to balance the following AVL-Tree using standard AVL-Tree balancing rotations. You are given the pointer to the node whose balance factor has been disturbed. 50 30 80 12 42 60 90 5 15 35 45 55 70 85 100 7 32 40 57 95 37