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:
“The search for happiness ... always ends in the ghastly sense of the bottomless nothingness into which you will inevitably fall if you strain any further.”
—D.H. (David Herbert)
“It never had been inside the room,
And only one of the two
Was afraid in an oft-repeated dream
Of what the tree might do.”
—Robert Frost (1874–1963)