2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/67037Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.16 pages, 6 figuresCombinatoricsMSC : 06B, 06A08, 05C05text