  Han recently discovered new hook length identities for binary trees. In this
paper, we extend Han's identities to binomial families of trees. Moreover, we
present a bijective proof of one of the identities for the family of ordered
trees.
