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:
“You will never be happy if you continue to search for what happiness consists of. You will never live if you are looking for the meaning of life.”
—Albert Camus (1913–1960)
“The wind flapped loose, the wind was still,
Shaken out dead from tree and hill:
I had walked on at the wind’s will,—
I sat now, for the wind was still.”
—Dante Gabriel Rossetti (1828–1882)