- in what order are positions visited during postorder traversal of the tree of figure - 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 if sogive an exampleotherwiseexplain why this cannot occur likewiseis it possible that the preorder traversal of visits the nodes in the reverse order of the postorder traversal of if sogive an exampleotherwiseexplain why this cannot occur - answer the previous question for the case when is proper binary tree with more than one node - consider the example of breadth-first traversal given in figure using the annotated numbers from that figuredescribe the contents of the queue before each pass of the while loop in code fragment to get startedthe queue has contents { before the first passand contents { before the second pass - the collections deque class supports an extend method that adds collection of elements to the end of the queue at once reimplement the breadthfirst method of the tree class to take advantage of this feature - give the output of the function parenthesize(tt root))as described in code fragment when is the tree of figure - what is the running time of parenthesize(tt root))as given in code fragment for tree with nodesr- describein pseudo-codean algorithm for computing the number of descendants of each node of binary tree the algorithm should be based on the euler tour traversal - the build expression tree method of the expressiontree class requires input that is an iterable of string tokens we used convenient example((( + ) )/(( - )+ )in which each character is its own tokenso that the string itself sufficed as input to build expression tree in generala stringsuch as ( must be explicitly tokenized into list so as to ignore whitespace and to recognize multidigit numbers as single token write utility methodtokenize(raw)that returns such list of tokens for raw string creativity - define the internal path lengthi( )of tree to be the sum of the depths of all the internal positions in likewisedefine the external path lengthe( )of tree to be the sum of the depths of all the external positions in show that if is proper binary tree with positionsthen ( (