RdB> A tree has key values on each node which label the various child nodes,
Not in my community.
A tree is a directed acyclic graph in which every vertex has at most
one predecessor and at most one vertex has no predecessor.
Trees with additional data associated either to the vertices or the
edges (such as the two kinds you've described) are still called trees.
Trust me, we're speaking of exactly the same data structure.
Juliusz
-
Linux-UTF8: i18n of Linux on all levels
Archive: http://mail.nl.linux.org/linux-utf8/
