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:
“On short, still days
At the shut of the year
We search the pathways
Where the coverts were.”
—Philip Larkin (1922–1986)
“If you believe in the soul, do not clutch at sensual sweetness before it is ripe on the slow tree of cause and effect.”
—Ralph Waldo Emerson (1803–1882)