Example of ID: Binary Trees
l
is a binary tree.
l
If T
1
and T
2
are binary trees, then so
is:
l
Extremal clause: The only binary
trees are those constructible by a
finite number of applications of the
above rules.
T
1
T
2
