Self-balancing Binary Search Tree
In computer science, a self-balancing (or height-balanced) binary search tree is any node-based binary search tree that automatically keeps its height (number of levels below the root) small in the face of arbitrary item insertions and deletions.
These structures provide efficient implementations for mutable ordered lists, and can be used for other abstract data structures such as associative arrays, priority queues and sets.
Read more about Self-balancing Binary Search Tree: Overview, Implementations, Applications
Famous quotes containing the words search and/or tree:
“So often has my judgment deceived me in my life, that I always suspect it, right or wrong,—at least I am seldom hot upon cold subjects. For all this, I reverence truth as much as any body; and ... if a man will but take me by the hand, and go quietly and search for it ... I’ll go to the world’s end with him:MBut I hate disputes.”
—Laurence Sterne (1713–1768)
“As a natural process, of the same character as the development of a tree from its seed, or of a fowl from its egg, evolution excludes creation and all other kinds of supernatural intervention.”
—Thomas Henry Huxley (1825–95)