
	Where results make sense

Topic: Exponential tree

Related Topics

Tree data structure

Tree structure

Tree search algorithm

List of graph theory topics

Tree (graph theory)

In the News (Fri 11 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	Exponential tree -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-20)
		An exponential tree is almost identical to a [binary search tree], with the exception that the dimension of the tree is not the same at all levels.
		In a normal binary search tree, each node has a dimension (d) of 1, and has 2^d children.
		In an exponential tree, the dimension = the depth of the node, with the root node having a d=1.
	www.absoluteastronomy.com /encyclopedia/e/ex/exponential_tree.htm (109 words)

	ipedia.com: Tree data structure Article (Site not responding. Last check: 2007-10-20)
		Each node has zero or more child nodes, which are below it in the tree.
		In a tree data structure, there is no distinction between the various children of a node --- none is the "first child" or "last child".
		See also binary tree for a discussion of pre-order, in-order and post-order traversal.
	www.ipedia.com /tree_data_structure.html (484 words)

Try your search on: Qwika (all wikis)