|
( Tree structure)
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. In graph theory, a tree is a connected acyclic graph (or sometimes, a connected directed acyclic graph in which every vertex has indegree 0 or 1). An acyclic graph which is not necessarily connected is sometimes called a forest (because it consists of trees). Every finite tree structure has a member that has no superior. This member is called the "root" or root node. It can be thought of as the starting node The converse is not true infinite tree structures may or may not have a root node. The lines connecting elements are called "branches", the elements themselves are called "nodes". Nodes without children are called "end-nodes" or "leaves".
|
Tree structure Subcategories
Tree structure Articles
|
| 
