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:
“Let the maiden, with erect soul, walk serenely on her way, accept the hint of each new experience, search in turn all the objects that solicit her eye, that she may learn the power and charm of her new-born being, which is the kindling of a new dawn in the recesses of space.”
—Ralph Waldo Emerson (1803–1882)
“Is not disease the rule of existence? There is not a lily pad floating on the river but has been riddled by insects. Almost every shrub and tree has its gall, oftentimes esteemed its chief ornament and hardly to be distinguished from the fruit. If misery loves company, misery has company enough. Now, at midsummer, find me a perfect leaf or fruit.”
—Henry David Thoreau (1817–1862)