In data structures, a series of connected nodes without cycles. One node is termed the root and is the starting point of all paths, other nodes termed leaves terminate the paths. It can be used to represent hierarchical structures, such as CIs.
A hierarchical calling sequemnce consisting of a root segment and one or more levels of segments called via the root segment.
a hierarchy of NODES to which other objects known as LEAVES can be attached
a type of data structure in which each element is attached to one or more elements directly beneath it
An abstract data structure representing the information content of an XML document. The tree structure always has a single root.
Used to connect terms in a subject-based hierarchy rather than alphabetical Syn.
A data structure that represents entities in nodes, with at most one parent node for each node, and with only one root node.
(of a tree 1) the set of conses that make up the tree. Note that while the car 1b component of each such cons is part of the tree structure, the objects that are the cars 2 of each cons in the tree are not themselves part of its tree structure unless they are also conses.
A tree structure is a way of representing the hierarchical nature of a structure in a graphical form. It is named a "tree structure" because the graph looks a bit like a tree, even though the tree is generally shown upside down compared with a real tree; that is to say with the root at the top and the leaves at the bottom.