We define a class of partially labeled trees and use them to find simple proofs for two recent enumeration results of Colin Defant concerning stack-sorting preimages of permutation classes. 7 pages, 5 figures
Discrete Mathematics & Theoretical Computer Science