Abstract: The number of (full) binary trees with n internal vertices is famously the Catalan number (2n)!/(n!(n+1!). Twenty years ago, Dr. Werner Krandick published a combinatorial gem investigating ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback