This is a homework question that I am unable to solve. Any help would be really appreciated.
Given $B$ an increasing binary tree with root $r$ and $n$ nodes labelled $1, 2, . . . , n$ such that on every path from root $r$ to a node, the labelling is increasing.
Prove that there are $n!$ different increasing binary trees.