Wiktionary
n. (context computing theory English) A tree (data structure) set up to facilitate searching.
Wikipedia
In computer science, a search tree is a tree data structure used for locating specific keys from within a set. 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.
Usage examples of "search tree".
But once the six or so brown-spotted eggs were laid and incubated, and the young hatched and reared, the couple would go their separate ways again to search tree trunks within their territory for insects and make the woods resound with their harsh laughing call.
No matter how carefully designed a search tree was, scanning, retrieval, and evaluation took finite time.