let be an ordered tree with more than one node is it possible that the preorder traversal of visits the nodes in the same order as the postorder traversal of tif sogive an exampleotherwiseargue why this cannot occur likewiseis it possible that the preorder traversal of visits the nodes in the reverse order of the postorder traversal of tif sogive an exampleotherwiseargue why this cannot occur - answer the previous question for the case when is proper binary tree with more than one node - what is the running time of parentheticrepresentation(tt root()(code fragment for tree with nodesr- draw (singlebinary tree such that each internal node of stores single character preorder traversal of yields examfun an inorder traversal of yields mafxuen - answer the following questions so as to justify proposition what is the minimum number of external nodes for proper binary tree with height hjustify your answer what is the maximum number of external nodes for proper binary tree with height hjustify your answer