The Tree::Nary class implements N-ary trees (trees of data with any number
of branches), providing the organizational structure for a tree
(collection) of any number of nodes, but knowing nothing about the
specific type of node used. It can be used to display hierarchical
database entries in an internal application (the NIS netgroup file is an
example of such a database). It offers the capability to select nodes on
the tree, and attachment points for nodes on the tree. Each attachment
point can support multiple child nodes.
The data field contains the actual data of the node. The next and previous
fields point to the node's siblings (a sibling is another node with the
same parent). The parent field points to the parent of the node, or is
*undef* if the node is the root of the tree. The children field points to
the first child of the node. The other children are accessed by using the
next pointer of each child.
This module is a translation (albeit not a direct one) from the C
implementation of N-ary trees, available in the GLIB distribution (see SEE
ALSO).