Abstract
A recursive tree is constructed by starting with a root node and repeatedly adjoining new nodes to one node of the tree already constructed. Such a tree can represent, for example, the heirarchy of a workforce of a company that grows via recruiting. At times of economic depression, the company may decide to lay off participants, and in some cases it is a fair policy to relieve the last senior worker (most recent entry in the tree). If we remove an edge from such a tree then it falls into two subtrees one of which contains the most recent entry. If we continue to remove edges from the successively smaller subtrees that contain the most recent entry, we eventually isolate the most recent entry. We consider how many randomly selected edges must be removed in average before isolating the most recent entry by this procedure.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
