摘要
In the excellent book of D. E. Knuth, an extensive discussion on some combinatorial problems on trees (oriented, ordered, etc)and their applications to computer science have been made. This paper aims at discussing several other combinatorial problems on t-ary trees. t-ary trees may be defined recursively as follows: a
