let be proper binary tree with height and nodes show that log( - < <( )/ for which values of and can the above lower and upper bounds on be attained with equalityr- describe generalization of the euler tour traversal to trees such that each internal node has three children describe how you could use this traversal to compute the height of each node in such tree - compute the output of algorithm tostringpostorder( , root())from code fragment on the tree of figure - illustrate the execution of algorithm diskspace(tt root()(code fragment on the tree of figure - let be the binary tree of figure give the output of tostringpostorder(tt root()(code fragment give the output of parentheticrepresentation(tt root()(code fragment - let be the binary tree of figure give the output of tostringpostorder(tt root()(code fragment