Tree structure: Difference between revisions

Revision as of 11:37, 6 April 2003

Revision as of 02:52, 2 June 2003

Line 7:

The converse is not true: infinite tree structures may have a root node.

<div style="width: 302px; float: right; margin-left:1em">[[Image:binary-tree-structure.png|Binary tree structure illustration]]<br>"Illustration: A tree structure showing the possible hierarchical organization of an encyclopedia. This specific example happens to be a [[complete binary tree]], which means all nodes have exactly zero or two child nodes."</div>

The lines connecting elements are called ''branches," the elements themselves are called "[[node|nodes]]." Nodes without children are called "end-nodes" or "leaves."

Line 18:

* "Sibling" ("brother" or "sister") nodes share the same parent nodes.

* A node that is connected to all lower-level nodes is called an "ancestor."

In the example, "encyclopedia" is the parent of "science" and "culture," its children. "Art" and "craft" are siblings, and children of "culture."

Line 28:

Tree structures are used extensively in [[computer science]] and [[telecommunications]].

== Examples of tree structures ==

* Internet: [[usenet hierarchy]], [[Yahoo! Subjectsubject Indexindex]]

* Information management: [[Dewey Decimal System]]

* Management: hierarchical [[organization]]al structures

Line 40 ⟶ 38:

* Project management: [[work breakdown structure]]

See also: [[B-tree]], (graph[[rooted theory)hierarchy]], [[tree data structure]], [[B tree (graph theory)]]

See: [[tree (graph theory)]], [[tree data structure]], [[B tree]]

See also: [[rooted hierarchy]]