In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position...

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, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number...

label associated with each node. Binary trees labelled this way are used to implement binary search trees and binary heaps, and are used for efficient...

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

the binary logarithm of 1 is 0, the binary logarithm of 2 is 1, the binary logarithm of 4 is 2, and the binary logarithm of 32 is 5. The binary logarithm...

binary search is a variation of binary search that uses a specific permutation of keys in an array instead of the sorted order used by regular binary...

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

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

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

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

Uniform binary search is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth's The Art of Computer Programming...

linear, binary, and hashing. Linear search algorithms check every record for the one associated with a target key in a linear fashion. Binary, or half-interval...

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

used to search in bounded lists. Exponential search can even out-perform more traditional searches for bounded lists, such as binary search, when the...

each element vary. Linear search is rarely practical because other search algorithms and schemes, such as the binary search algorithm and hash tables...

these trees. Random binary trees have been used for analyzing the average-case complexity of data structures based on binary search trees. For this application...

toFind, search lower half return binary_search(data, toFind, start, mid-1); else //Data is less than toFind, search upper half return binary_search(data...

Compared to binary search where the sorted array is divided into two equal-sized parts, one of which is examined further, Fibonacci search divides the...

data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for...

A well-known example is binary search. Abstractly, a dichotomic search can be viewed as following edges of an implicit binary tree structure until it...

methods. The method is also called the interval halving method, the binary search method, or the dichotomy method. For polynomials, more elaborate methods...

quicksort's practical dominance over other sorting algorithms. The following binary search tree (BST) corresponds to each execution of quicksort: the initial pivot...

between key values are sensible. By comparison, binary search always chooses the middle of the remaining search space, discarding one half or the other, depending...

achieved by using binary search instead. The following C-program is an implementation. // Integer square root (using binary search) unsigned int isqrt(unsigned...

side-by-side), then using binary insertion sort may yield better performance. Binary insertion sort employs a binary search to determine the correct location...

linear search, but worse than a binary search. The advantage over the latter is that a jump search only needs to jump backwards once, while a binary can...

between nodes, which represent each character in the key. Unlike a binary search tree, nodes in the trie do not store their associated key. Instead,...

In number theory, the Stern–Brocot tree is an infinite complete binary tree in which the vertices correspond one-for-one to the positive rational numbers...

General declarations, similar to article Binary search tree: struct bst_node { // one node of the binary search tree struct bst_node *child[2]; // each:...