- describe how to clone linkedbinarytree instance representing proper binary treewith use of the attach method - describe how to clone linkedbinarytree instance representing (not necessarily properbinary treewith use of the add left and add right methods - we can define binary tree representation for an ordered general tree as follows (see figure )for each position of there is an associated position of if is leaf of then in does not have left childotherwise the left child of is where is the first child of in if has sibling ordered immediately after it in then is the right child of in otherwise does not have right child given such representation of general ordered tree answer each of the following questionsa is preorder traversal of equivalent to preorder traversal of is postorder traversal of equivalent to postorder traversal of is an inorder traversal of equivalent to one of the standard traversals of if sowhich onea ( (bfigure representation of tree with binary tree(atree (bbinary tree for the dashed edges connect nodes of that are siblings in - give an efficient algorithm that computes and printsfor every position of tree the element of followed by the height of ' subtree - give an ( )-time algorithm for computing the depths of all positions of tree where is the number of nodes of - the path length of tree is the sum of the depths of all positions in describe linear-time method for computing the path length of tree - the balance factor of an internal position of proper binary tree is the difference between the heights of the right and left subtrees of show how to specialize the euler tour traversal of section to print the balance factors of all the internal nodes of proper binary tree