Difference between revisions of "Tree structure"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→See also) |
Karl Jones (Talk | contribs) |
||
| Line 4: | Line 4: | ||
It is named a "tree structure" because the classic representation resembles a tree, even though the chart is generally upside down compared to an actual tree, with the "root" at the top and the "leaves" at the bottom. | It is named a "tree structure" because the classic representation resembles a tree, even though the chart is generally upside down compared to an actual tree, with the "root" at the top and the "leaves" at the bottom. | ||
| + | |||
| + | == Document Object Model == | ||
| + | |||
| + | The [[Document Object Model]] uses a tree structure. TO DO: summarize. | ||
== Graph theory == | == Graph theory == | ||
| Line 12: | Line 16: | ||
* [[Analogy]] | * [[Analogy]] | ||
| + | * [[Document Object Model]] | ||
* [[Graph theory]] | * [[Graph theory]] | ||
* [[Hierarchy]] | * [[Hierarchy]] | ||
Revision as of 12:50, 2 September 2015
In mathematics and computer science, a tree structure or tree diagram is a way of representing the hierarchical nature of a structure in a graphical form.
Description
It is named a "tree structure" because the classic representation resembles a tree, even though the chart is generally upside down compared to an actual tree, with the "root" at the top and the "leaves" at the bottom.
Document Object Model
The Document Object Model uses a tree structure. TO DO: summarize.
Graph theory
See Graph theory) and Tree (graph theory).
See also
External Links
- Tree structure @ Wikipedia
