Tree structure: Difference between revisions

Revision as of 12:18, 28 April 2004

Revision as of 14:33, 29 April 2004

Line 4:

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|graph theory|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.