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:
“Professor Eucalyptus said, “The search
For reality is as momentous as
The search for god.” It is the philosopher’s search
For an interior made exterior
And the poet’s search for the same exterior made
Interior: breathless things broodingly abreath....”
—Wallace Stevens (1879–1955)
“A tree may grow a thousand feet tall, but its leaves will return to its roots.”
—Chinese proverb.