A hierarchy is a tree-like structure that defines classes of information. Each class is represented by a different level of the hierarchy. A hierarchy is related to one or more tables, called detail tables, that contain detail data associated with the hierarchy. The detail table is keyed to the root level of the hierarchy. The structure at each level of the hierarchy is called a node. A hierarchy has the following types of nodes:
Root node.
The highest node in the structure and the origin of all other nodes. The root node represents the hierarchy.
Leaf nodes.
The lowest level in the structure. The leaf nodes are keyed to the detail table through a range of values. This range of values is defined by a beginning and ending value, called From_Value and To_Value, respectively.
Higher nodes.
The nodes between the root and leaf nodes. Higher nodes represent the logical path from the root node to the leaf nodes. There may be multiple levels of higher nodes.