In C++ Language please

4.8 Give the prefix, infix, and postfix expressions corresponding to the tree in Figure 4.75 . 4.26 Write the functions to perform the double rotation without the inefficiency of doing two single rotations. 4.27 Show the result of accessing the keys 3, 9,1,5 in order in the splay tree in Figure 4.76 . 4.y a. Show the result of inserting 3,1, 4, 6, 9, 2, 5, 7 into an initially empty binary search tree. b. Show the result of deleting the root. 4.28 Show the result of deleting the element with key 6 in the resulting splay tree for the previous exercise. 4.31 Write efficient functions that take only a pointer to the root of a binary tree, T, and compute a. the number of nodes in T b. the number of leaves in T c. the number of full nodes in T 4.19 Show the result of inserting 2, 1, 4, 5, 9, 3, 6, 7 into an initially empty AVL tree. 4.22 Design a linear-time algorithm that verifies that the height information in an AVL tree is correctly 4.45 Two binary trees are similar if they are both empty or both nonempty and have similar left and right maintained and that the balance property is in order. subtrees. Write a function to decide whether two binary trees are similar. What is the running time of your function