Grammatical codes of trees

The problem of coding (chain free) trees by words where the length of the word coding a tree t equals the number of leaves of t is investigated. The notion of an insertive strict code is introduced and investigated-these are codes of a grammatical nature. It is shown that there are exactly 120 insertive strict codes. A characterization of these codes (and their various subclasses) is given in grammatical terms.