I try to follow this, only to have a simpler example.
Define a
binary tree with INT in its nodes:
That perhaps...
https://svn.origo.ethz.ch/algebraist/trunk/aldor/lib/axllib/test/tree.as
Well, you'd have to remove semicola and braces, of course and add the
)abbrev line, but it looks pretty much like what you want.
A leaf ther is something of the form [nodevalue, [], []], i.e. a value
together with two empty (binary) trees.
Ralf
--
You received this message because you are subscribed to the Google Groups "FriCAS -
computer algebra system" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/fricas-devel?hl=en.
