### Search

are.my
Binary search tree
In computer science, a binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree data structure whose internal nodes
Self-balancing binary search tree
In computer science, a self-balancing binary search tree is any node-based binary search tree that automatically keeps its height (maximal number of levels
Optimal binary search tree
binary search tree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search
Binary search algorithm
In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position
Binary tree
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the
Search tree
application stores the entire key–value pair at that particular location. A Binary Search Tree is a node-based data structure where each node contains a key and
Splay tree
splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary search
Tree traversal
depth-first search (DFS), the search tree is deepened as much as possible before going to the next sibling. To traverse binary trees with depth-first search, perform
Red–black tree
In computer science, a red–black tree is a kind of self-balancing binary search tree. Each node stores an extra bit representing "color" ("red" or "black")
Treap
binary 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