Ralf Hemmecke <[EMAIL PROTECTED]> writes: > Oh, by the way, the above recursive definition of binary trees not only > defines the data structure but also the exponential and ordinary generating > series. So one could ask how many trees are there with 7 nodes (labelled or > unlabelled). In fact, it should also be possible, to generate all these > trees.
Yes it is. With and without labels. And the prettiest thing of all is that it should be quite easy to add code that gives those recursively generated domains more structure. For example, one would maybe like to construct a specific binary tree, or take two and add them together and so on. Martin _______________________________________________ Axiom-developer mailing list [email protected] http://lists.nongnu.org/mailman/listinfo/axiom-developer
