- Trees. The external path lengthof a binary tree is the sum of the lerngths (number of arca) of the pathes from the root to all the leaves of the tree. 1. What is the external path length of the following tree? 2. A regular binary treeis a binary tree where every internal node has exactly two subtrees. Weites a recursive function that computes the external path length of a regular binary tree, assiunung that you have at your disposal a Boolean function that tells you whether a tree is a loat and an inteens function that returns the number of leaves of a binary tree. int EPL (treeType t) (... ) 3. Show the trace of execution of the function defined in (b) on the tree given in (a). EPL(A)=