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:
“In the examples that I here bring in of what I have [read], heard, done or said, I have refrained from daring to alter even the smallest and most indifferent circumstances. My conscience falsifies not an iota; for my knowledge I cannot answer.”
—Michel de Montaigne (1533–1592)
“There are many examples of women that have excelled in learning, and even in war, but this is no reason we should bring ‘em all up to Latin and Greek or else military discipline, instead of needle-work and housewifry.”
—Bernard Mandeville (1670–1733)
“Histories are more full of examples of the fidelity of dogs than of friends.”
—Alexander Pope (1688–1744)