Tree structure: Difference between revisions

Revision as of 20:54, 28 November 2002

Revision as of 05:33, 10 March 2003

Line 2:

A '''tree structure''' is a way of representing the [[hierarchy|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 terms of [[graph]] theory, a tree can be described as a "connected directed acyclic graph". A collection of unconnected tree structures is sometimes described by graph theorists as a "forest". See [[tree (graph theory)]] for more mathematical background behind a tree structure.

Every [[finite]] tree structure a member which has no [[superior (hierarchy)|superior]]. This member is called the ''root'' or [[root node]].