Abstract
The combination of APL2 constructs and direct definition notation makes the description and implementation of complex generic types easy and natural. This paper illustrates this with an APL2 paradigm for modelling binary trees. It considers the problems of constructing trees, inserting new items, searching for items, counting leaves, counting comparisons, and testing for equivalence.