edgeCut(T,e,newl)
edgeCut(T,E,newl)
This function outputs the two subtrees of T obtained by deleting edge e from T and then readding the edge to each of the two resulting subtrees. Both subtrees share a copy of the edge e and the newly labeled leaf adjacent to e. Other than this overlap, they are disjoint.
Each subtree in P may have at most one leaf that was not a leaf of T, and therefore previously unlabeled. The label for this new leaf is input as newl.




The object edgeCut is a method function.