History of Tree data structure

Difference (from prior major revision) (minor diff, author diff)

Changed: 1c1

A tree is a hierarchical data structure made up of nodes. Each node has zero or more child nodes, which are below it in the tree (in computer science, unlike in nature, trees grow down, not up). The node of which a node is a child is called its parent node. The base node of the tree is called the root node. Nodes with no children are called leaf nodes.

A tree is a hierarchical data structure made up of nodes. Each node has zero or more child nodes, which are below it in the tree (in computer science, unlike in nature, trees grow down, not up). The node of which a node is a child is called its parent node. A child has only one parent. If the tree has a single node without a parent, this node is called the root node (or root). Nodes with no children are called leaf nodes.

Changed: 5c5

	Revision 5 . . (edit) October 29, 2001 4:10 pm by Kragen [Fixed link.]
	Revision 4 . . October 26, 2001 3:40 am by Seb
	Revision 3 . . October 26, 2001 1:48 am by (logged).157.137.xxx [Added distinction between abstract trees and their representations in computers; linked to ordered tree.]
	Revision 2 . . (edit) October 6, 2001 1:40 pm by BlckKnght [typofix in link]
	Revision 1 . . September 30, 2001 6:39 pm by BlckKnght [initial entry]