- find the value of the arithmetic expression associated with each subtree of the binary tree of figure - draw an arithmetic expression tree that has four external nodesstoring the numbers and (with each number stored in distinct external nodebut not necessarily in this order)and has three internal nodeseach storing an operator from the set {+- /}so that the value of the root is the operators may return and act on fractionsand an operator may be used more than once - draw the binary tree representation of the following arithmetic expression"((( ( ))/(( (( ) ) - justify table summarizing the running time of the methods of tree represented with linked structureby providingfor each methoda description of its implementationand an analysis of its running time - the linkedbinarytree class provides only nonpublic versions of the update methods discussed on page implement simple subclass named mutablelinkedbinarytree that provides public wrapper functions for each of the inherited nonpublic update methods - let be binary tree with nodesand let (be the level numbering function of the positions of as given in section show thatfor every position of ( < show an example of binary tree with seven nodes that attains the above upper bound on (pfor some position - show how to use the euler tour traversal to compute the level number ( )as defined in section of each position in binary tree - let be binary tree with positions that is realized with an array representation aand let (be the level numbering function of the positions of as given in section give pseudo-code descriptions of each of the methods rootparentleftrightis leafand is root - our definition of the level numbering function ( )as given in section began with the root having number some authors prefer to use level numbering (pin which the root is assigned number because it simplifies the arithmetic for finding neighboring positions redo exercise - but assuming that we use level numbering (pin which the root is assigned number - draw binary tree that simultaneously satisfies the followingeach internal node of stores single character preorder traversal of yields examfun an inorder traversal of yields mafxuen - in what order are positions visited during preorder traversal of the tree of figure