On Han's hook length formulas for trees (Q640404)

\textit{G.-H. Han} [``New hook length formulas for binary trees,'' Combinatorica 30, No. 2, 253--256 (2010; Zbl 1250.05017)] obtained two nice hook length formulas for binary trees, later \textit{L.L.M. Yang} [``Generalizations of Han's hook length identities,'' \url{arXiv:0805.0109 [math.CO]}] extended one of Han's formula to \(k\)-ary trees via the generating function method. In the paper under review, the authors present combinatorial proofs of both Yang's formula and the other formula of Han for binary trees. The bijections are based on the structure of \(k\)-ary trees associated with staircase labelings.