Because each permutation is independent of all the others, reordering inference via a single pass through the tree is optimal.
we impose a maximum terminal length of L, but otherwise allow any binary tree.