representation of - let be (possibly improperbinary tree with nodesand let be the sum of the depths of all the external nodes of describe configuration for such that is ohm( such tree would be the worst case for the asymptotic running time of algorithm height (code fragment - for tree tlet denote the number of its internal nodesand let denote the number of its external nodes show that if every internal node in has exactly childrenthen - describe how to clone proper binary tree using the attach method instead of methods insertleft and insertright - the balance factor of an internal node 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