• Thumbnail for 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 with the key of...
    30 KB (3,137 words) - 05:17, 27 June 2025
  • Thumbnail for Binary search
    In computer science, binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position...
    77 KB (10,006 words) - 10:57, 21 June 2025
  • binary search tree (Optimal BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search...
    19 KB (2,965 words) - 19:58, 19 June 2025
  • Thumbnail for Binary tree
    In computer science, a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child...
    36 KB (5,187 words) - 19:52, 14 July 2025
  • Thumbnail for Self-balancing binary search tree
    In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number...
    8 KB (1,114 words) - 13:48, 2 February 2025
  • 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...
    5 KB (710 words) - 16:22, 6 January 2024
  • 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...
    26 KB (2,894 words) - 19:29, 14 May 2025
  • 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...
    32 KB (4,628 words) - 22:24, 6 February 2025
  • Thumbnail for Threaded binary tree
    computing, a threaded binary tree is a binary tree variant that facilitates traversal in a particular order. An entire binary search tree can be easily traversed...
    9 KB (1,201 words) - 08:14, 21 February 2025
  • Thumbnail for 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...
    23 KB (3,214 words) - 14:44, 12 July 2025
  • Thumbnail for Red–black tree
    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...
    78 KB (9,374 words) - 08:42, 16 July 2025
  • Thumbnail for Random binary tree
    for these trees. Random binary trees have been used for analyzing the average-case complexity of data structures based on binary search trees. For this...
    39 KB (5,297 words) - 11:40, 12 July 2025
  • Thumbnail for Binary space partitioning
    representation of objects within the space in the form of a tree data structure known as a BSP tree. Binary space partitioning was developed in the context of...
    27 KB (3,048 words) - 19:07, 1 July 2025
  • Thumbnail for Multiplicative binary search
    level-order sequence of the corresponding balanced binary search tree. This places the first pivot of a binary search as the first element in the array. The second...
    4 KB (397 words) - 14:35, 17 February 2025
  • the intervals do not overlap and they can be inserted into a simple binary search tree and queried in O ( log ⁡ n ) {\displaystyle O(\log n)} time. However...
    24 KB (3,577 words) - 00:57, 7 July 2024
  • 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...
    14 KB (1,784 words) - 21:43, 13 November 2024
  • approach to the dynamic optimality problem on online algorithms for binary search trees involves reformulating the problem geometrically, in terms of augmenting...
    11 KB (1,621 words) - 18:27, 28 November 2023
  • insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children. By allowing...
    53 KB (7,348 words) - 19:53, 16 July 2025
  • context—in particular, filesystems. This is primarily because unlike binary search trees, B+ trees have very high fanout (number of pointers to child nodes in...
    25 KB (3,263 words) - 07:54, 1 July 2025
  • Thumbnail for Tree sort
    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...
    5 KB (644 words) - 04:27, 5 April 2025
  • In computer science, a scapegoat tree is a self-balancing binary search tree, invented by Arne Andersson in 1989 and again by Igal Galperin and Ronald...
    13 KB (1,886 words) - 20:26, 29 September 2024
  • 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...
    24 KB (2,802 words) - 02:21, 23 April 2025
  • Thumbnail for AVL tree
    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...
    38 KB (4,290 words) - 17:18, 6 July 2025
  • Thumbnail for Trie
    Trie (redirect from Prefix tree)
    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...
    31 KB (3,331 words) - 17:05, 30 June 2025
  • Randomized binary search tree Red–black tree Rope Scapegoat tree Self-balancing binary search tree Splay tree T-tree Tango tree Threaded binary tree Top tree Treap...
    9 KB (914 words) - 05:55, 20 March 2025
  • Thumbnail for K-d tree
    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...
    28 KB (3,770 words) - 11:20, 14 October 2024
  • Thumbnail for Tree (abstract data type)
    assumes specifically a binary tree.) A level-order walk effectively performs a breadth-first search over the entirety of a tree; nodes are traversed level...
    17 KB (2,207 words) - 10:40, 22 May 2025
  • Thumbnail for Tree rotation
    mathematics, tree rotation is an operation on a binary tree that changes the structure without interfering with the order of the elements. A tree rotation...
    10 KB (1,443 words) - 07:22, 19 March 2024
  • Thumbnail for Left-leaning red–black tree
    red–black (LLRB) tree is a type of self-balancing binary search tree, introduced by Robert Sedgewick. It is a variant of the red–black tree and guarantees...
    5 KB (496 words) - 16:42, 18 October 2024
  • Thumbnail for Cartesian tree
    used in the definition of the treap and randomized binary search tree data structures for binary search problems, in comparison sort algorithms that perform...
    32 KB (4,294 words) - 21:45, 11 July 2025