Finding the set of leaves for an unbounded tree is a nontrivial process in both the Weihrauch and reverse mathematics settings. Despite this, many combinatorial principles for trees are equivalent to their restrictions to trees with leaf sets. For example, let WF ˆ denote the problem of choosing which trees in a sequence are well-founded, and let PK denote the problem of finding the perfect kernel of a tree. Let WF ˆ L and PK L denote the restrictions of these principles to trees with leaf sets. Then WF ˆ, WF ˆ L , PK, and PK L are all equivalent to Π 1 1 – CA 0 over RCA 0 , and all strongly Weihrauch equivalent.