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...

In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure with the key of each...

In computer science, tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting...

In computer science, Monte Carlo tree search (MCTS) is a heuristic search algorithm for some kinds of decision processes, most notably those employed in...

In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number...

particular, filesystems. This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in a node...

neighbor searches) & Creating point clouds. k-d trees are a special case of binary space partitioning trees. The k-d tree is a binary tree in which every...

binary search tree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search time...

lists. The binary search tree and B-tree data structures are based on binary search. Binary search works on sorted arrays. Binary search begins by comparing...

In computer science, a priority search tree is a tree data structure for storing points in two dimensions. It was originally introduced by Edward M. McCreight...

In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and...

ternary search tree is a type of trie (sometimes called a prefix tree) where nodes are arranged in a manner similar to a binary search tree, but with...

partitioning Huffman tree K-ary tree Kraft's inequality Optimal binary search tree Random binary tree Recursion (computer science) Red–black tree Rope (computer...

A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary...

A Fenwick tree or binary indexed tree (BIT) is a data structure that stores an array of values and can efficiently compute prefix sums of the values and...

Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and explores...

station" (although not taking roads into account). The R-tree can also accelerate nearest neighbor search for various distance metrics, including great-circle...

computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. In an AVL tree, the heights of the...

game is to search the game tree using any of numerous tree search algorithms, combined with minimax-like rules to prune the tree. The game tree for tic-tac-toe...

tree or prefix tree, is a specialized search tree data structure used to store and retrieve strings from a dictionary or set. Unlike a binary search tree...

specially constructed database structures, such as search trees, hash maps, and database indexes. Search algorithms can be classified based on their mechanism...

science, a tree is a widely used abstract data type that represents a hierarchical tree structure with a set of connected nodes. Each node in the tree can be...

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...

hash tables and search trees. It is sometimes also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized...

search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of ordered keys and allow binary searches...

Distributed tree search (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner. Their purpose is to iterate...

A tree sort is a sort algorithm that builds a binary search tree from the elements to be sorted, and then traverses the tree (in-order) so that the elements...

tree is a self-balancing binary search tree data structure noted for fast storage and retrieval of ordered information. The nodes in a red-black tree...

In computer science, an order statistic tree is a variant of the binary search tree (or more generally, a B-tree) that supports two additional operations...

In computer science, an interval tree is a tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap...