A Strahler bijection between Dyck paths and planar trees (Q1348155): Difference between revisions

The paper investigates binary trees \(B= (L,r,R)\), where \(L\) and \(R\) are the left and right subtree, respectively, and \(r\) denotes the root of \(B\). The Strahler number \(\text{St}(B)\) is defined by the following inductive process: Label the leaves by 1 and each internal vertex by \(\text{St}(R)+ 1\) if \(\text{St}(R)= \text{St}(L)\) and by \(\max\{\text{St}(L),\text{St}(R)\}\) otherwise. Then \(\text{St}(B)\) is the Strahler number of the root. The paper discusses several properties of binary trees with a given Strahler number and gives combinatorial consequences of these facts.