A 'tree' represents a connected acyclic undi_graph with a node chosen as root. Each node of a tree, different from root, has a 'father_node', a 'father_edge', and an ordered linear list (left-right) of son-nodes. Also, each node has associated a level, that is the length of a shortest path from root to the given node (root is at level 0).

Page generated from source code by SCP Source Code Publisher.
SCP © INTEGRA Sistemi, www.IntegraSistemi.com