The number of (full) binary trees with n internal vertices is famously the Catalan number (2 n)!/ (n! (n +1!). Twenty years ago, Werner Krandick published a combinatorial gem investigating certain ...