Difference between revisions of "Search tree"
Karl Jones (Talk | contribs) (Created page with "In computer science, a '''search tree''' is a tree data structure used for locating specific keys from within a set. == Description == In order...") |
(No difference)
|
Latest revision as of 10:17, 29 August 2016
In computer science, a search tree is a tree data structure used for locating specific keys from within a set.
Description
In order for a tree to function as a search tree, the key for each node must be greater than any keys in subtrees on the left and less than any keys in subtrees on the right.
The advantage of search trees is their efficient search time given the tree is reasonably balanced, which is to say the leaves at either end are of comparable depths. Various search-tree data structures exist, several of which also allow efficient insertion and deletion of elements, which operations then have to maintain tree balance.
Search trees are often used to implement an associative array. The search tree algorithm uses the key from the key-value pair to find a location, and then the application stores the entire key–value pair at that location.
See also
External links
- Search tree @ Wikipedia
