EXPLAIN IN DETAIL LANGUAGE = PYTHON Thankyou

Question # 4: a) Suppose the numbers 7,5,1,8,3,6,0,9,4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the inorder traversal sequence of the resultant tree? b) Suppose ENDPOST, ENDIN, ENDPRE represent the last vertex visited in a postorder, inorder and preorder traversal respectively of a complete binary tree. Which of the following is always true? Explain. ENDIN = ENDPOST ENDIN = ENDPRE ENDPRE = ENDPOST None of these c) Suppose an initially empty stackS has executed a total of 25 push operations, 12 top operations, and 10 pop operations, 3 of which raised Empty errors that were caught and ignored. What is the current size of S