Special Trees

We did not stress-test the special tree algorithm insofar as running it until the resource or CPU usage became unreasonable. We were able, however, to generate and label $\mathit{Special}(30,30)$ in a matter of seconds, and such a tree is of order 931. It is reasonable to assume that, aside from memory constraints, $k$ and $t$ can be rather large, quite safely.