Data structure in tree form sorted for fast lookup
Not to be confused with tree search.
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.[1]
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 particular location.
^Black, Paul and Pieterse, Vreda (2005). "search tree". Dictionary of Algorithms and Data Structures
In computer science, a binary searchtree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each...
science, a searchtree is a tree data structure used for locating specific keys from within a set. In order for a tree to function as a searchtree, the key...
In computer science, tree traversal (also known as treesearch and walking the tree) is a form of graph traversal and refers to the process of visiting...
In computer science, Monte Carlo treesearch (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in...
lists. The binary searchtree and B-tree data structures are based on binary search. Binary search works on sorted arrays. Binary search begins by comparing...
binary searchtree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary searchtree which provides the smallest possible search time...
In computer science, a priority searchtree is a tree data structure for storing points in two dimensions. It was originally introduced by Edward M. McCreight...
A splay tree is a binary searchtree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary...
game is to search the game tree using any of numerous treesearch algorithms, combined with minimax-like rules to prune the tree. The game tree for tic-tac-toe...
partitioning Huffman tree K-ary tree Kraft's inequality Optimal binary searchtree Random binary tree Recursion (computer science) Red–black tree Rope (computer...
specially constructed database structures, such as searchtrees, hash maps, and database indexes. Search algorithms can be classified based on their mechanism...
technique in machine learning and search algorithms that reduces the size of decision trees by removing sections of the tree that are non-critical and redundant...
computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary searchtree. In an AVL tree, the heights of the...
Distributed treesearch (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner. Their purpose is to iterate...
a WAVL tree or weak AVL tree is a self-balancing binary searchtree. WAVL trees are named after AVL trees, another type of balanced searchtree, and are...
trie (/ˈtraɪ/, /ˈtriː/), also called digital tree or prefix tree, is a type of k-ary searchtree, a tree data structure used for locating specific keys...
hash tables and searchtrees. It is sometimes also possible to solve the problem using directly addressed arrays, binary searchtrees, or other more specialized...
greedy algorithm. Beam search uses breadth-first search to build its searchtree. At each level of the tree, it generates all successors of the states at...
intervals do not overlap and they can be inserted into a simple binary searchtree and queried in O ( log n ) {\displaystyle O(\log n)} time. However...
for these trees. Random binary trees have been used for analyzing the average-case complexity of data structures based on binary searchtrees. For this...
Global Information