About half the middle binomial coefficient (Q2755046)

A bijection is described between the set of nodes of degree 1 in ordered trees with \(n+1\) edges and the set of \(2n+2\)-length Dyck paths. The generating function for \(f_{n,k}\) is determined in terms of the generating function for the Catalan numbers (\(f_{n,k}\) is the number of points of height \(k\) in Dyck paths of length \(2n\)). It is also shown that the number of nodes at level \(k\) in ordered trees of \(n\) edges is \({{2k+1}\over{n+k+1}}{{2n}\choose{n-k}}\).