
	Where results make sense

Topic: Binary search tree

Related Topics

Binary tree sort

Postorder traversal

Splay tree

AVL tree

Binary search

Binary logarithm

List of algorithms

Quicksort

Heapsort

Shell sort

Analysis of algorithms

Cubic equation

Bubble sort

CYK algorithm

Big O notation

In the News (Fri 27 Nov 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	AVL tree - Wikipedia, the free encyclopedia
		In an AVL tree the heights of the two child subtrees of any node differ by at most one, therefore it is also called height-balanced.
		While AVL trees are theoretically quite sound, they are not commonly implemented due to their high implementation complexity to keep it balanced, making development less effective when compared to self-correcting tree structures, such as splay trees or heaps.
		Insertion into an AVL tree may be carried out by inserting the given value into the tree as if it were an unbalanced binary search tree, and then retracing one's steps toward the root, rotating about any nodes which have become unbalanced during the insertion (see tree rotation).
	en.wikipedia.org /wiki/AVL_tree (652 words)

	Encyclopedia :: encyclopedia : Exponential tree (Site not responding. Last check: 2007-11-07)
		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
		In an exponential tree, the dimension equals the depth of the node, with the root node having a d = 1.
	www.hallencyclopedia.com /Exponential_tree (130 words)

	Fractions on a Binary Tree II (Site not responding. Last check: 2007-11-07)
		Fractions on a Binary Tree II We have already discussed an instance of a binary tree related to the Stern-Brocot tree.
		For n odd, let m be obtained from n by inverting the internal (all, but the first and the last) digits of the binary representation of n (0 to 1, 1 to 0).
		Let the binary representation of m be the reverse (written in the reverse order) of the binary representation of n.
	www.cut-the-knot.org /blue/Fusc.shtml (1074 words)

	tabulas.com: roy: danger smells like clean socks
		Introduction - In search of the One True Layout
		Clean CSS - A Resource for Web Designers
		google tells blogspot user he can't put msn search on his blog
	www.tabulas.com /~roy/links.html (1653 words)

Try your search on: Qwika (all wikis)