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)
“The tree which moves some to tears of joy is in the eyes of others only a green thing that stands in the way. Some see nature all ridicule and deformity ... and some scarce see nature at all. But to the eyes of the man of imagination, nature is imagination itself.”
—William Blake (1757–1827)