Examples
Some examples of search-tree data structures are:
- AVL trees, Red-black trees, splay trees and Tango Trees which are instances of self-balancing binary search trees;
- Ternary search trees, in which each internal node has exactly three children;
- B trees, commonly used in databases;
- B+ trees, like B trees but with all data values stored in the leaves;
- van Emde Boas trees, very efficient if the data values are fixed-size integers.
Read more about this topic: Search Tree
Famous quotes containing the word examples:
“It is hardly to be believed how spiritual reflections when mixed with a little physics can hold people’s attention and give them a livelier idea of God than do the often ill-applied examples of his wrath.”
—G.C. (Georg Christoph)
“Histories are more full of examples of the fidelity of dogs than of friends.”
—Alexander Pope (1688–1744)
“No rules exist, and examples are simply life-savers answering the appeals of rules making vain attempts to exist.”
—André Breton (1896–1966)