# 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 each internal node being greater than all the keys in the respective node's left subtree and less than the ones in its right subtree. The time complexity of operations on the binary search tree is directly proportional to the height of the tree.

Binary search tree
Typetree
Invented1960
Invented byP.F. Windley, A.D. Booth, A.J.T. Colin, and T.N. Hibbard
Time complexity in big O notation
Algorithm Space Average Worst case O(n) O(n) O(log n) O(n) O(log n) O(n) O(log n) O(n) Fig. 1: A binary search tree of size 9 and depth 3, with 8 at the root. The leaves are not drawn.

Binary search trees allow binary search for fast lookup, addition, and removal of data items. Since the nodes in a BST are laid out in such a way that each comparison skips about half of the remaining tree, the lookup performance is proportional to that of binary logarithm. BSTs are devised in the 1960s for the problem of efficient storage of labeled data and are attributed to Conway Berners-Lee and David Wheeler.

The performance of a binary search tree is dependent on the order of insertion of the nodes into the tree since arbitrary insertions may lead to degeneracy; several variations of the binary search tree can be built with guaranteed worst-case performance. The basic operations include: search, traversal, insert and delete. BSTs with guaranteed worst-case complexities perform better than an unsorted array, which would require linear search time.

The complexity analysis of BST shows that, on average, the insert, delete and search takes $O(\log n)$ for $n$ nodes. In the worst case, they degrade to that of a singly linked list: $O(n)$ . To address the boundless increase of the tree height with arbitrary insertions and deletions, self-balancing variants of BSTs are introduced to bound the worst lookup complexity to that of the binary logarithm. AVL trees were the first self-balancing binary search trees, invented in 1962 by Georgy Adelson-Velsky and Evgenii Landis.

Binary search trees can be used to implement abstract data types such as dynamic sets, lookup tables and priority queues, and used in sorting algorithms such as tree sort.

## History

The binary search tree algorithm was discovered independently by several researchers, including P.F. Windley, Andrew Donald Booth, Andrew Colin, Thomas N. Hibbard. The algorithm is attributed to Conway Berners-Lee and David Wheeler, who used it for storing labeled data in magnetic tapes in 1960. One of the earliest and popular binary search tree algorithm is that of Hibbard.

The time complexities of a binary search tree increases boundlessly with the tree height if the nodes are inserted in an arbitrary order, therefore self-balancing binary search trees were introduced to bound the height of the tree to $O(logn)$ . Various height-balanced binary search trees were introduced to confine the tree height, such as AVL trees, Treaps, and red–black trees.

The AVL tree was invented by Georgy Adelson-Velsky and Evgenii Landis in 1962 for the efficient organization of information. It was the first self-balancing binary search tree to be invented.

## Overview

A binary search tree is a rooted binary tree in which the nodes are arranged in total order in which the nodes with keys greater than any particular node is stored on the right sub-trees and the ones with equal to or less than are stored on the left sub-tree satisfying the binary search property.: 298 : 287

Binary search trees are also efficacious in sortings and search algorithms. However, the search complexity of a BST depends upon the order in which the nodes are inserted and deleted; since in worst case, successive operations in the binary search tree may lead to degeneracy and form a singly linked list (or "unbalanced tree") like structure, thus has the same worst-case complexity as a linked list.: 299-302

Binary search trees are also a fundamental data structure used in construction of abstract data structures such as sets, multisets, and associative arrays.

## Operations

### Searching

Searching in a binary search tree for a specific key can be programmed recursively or iteratively.

Searching begins by examining the root node. If the tree is ${\text{nil}}$ , the key being searched for does not exist in the tree. Otherwise, if the key equals that of the root, the search is successful and the node is returned. If the key is less than that of the root, the search proceeds by examining the left subtree. Similarly, if the key is greater than that of the root, the search proceeds by examining the right subtree. This process is repeated until the key is found or the remaining subtree is ${\text{nil}}$ . If the searched key is not found after a ${\text{nil}}$  subtree is reached, then the key is not present in the tree.: 290–291

#### Recursive search

The following pseudocode implements the BST search procedure through recursion.: 290

  Recursive-Tree-Search(x, key) if x = NIL or key = x.key then return x if key < x.key then return Recursive-Tree-Search(x.left, key) else return Recursive-Tree-Search(x.right, key) end if 

The recursive procedure continues until a ${\text{nil}}$  or the ${\text{key}}$  being searched for are encountered.

#### Iterative search

The recursive version of the search can be "unrolled" into a while loop. On most machines, the iterative version is found to be more efficient.: 291

  Iterative-Tree-Search(x, key) while x ≠ NIL and key ≠ x.key then if key < x.key then x := x.left else x := x.right end if repeat return x 

Since the search may proceed till some leaf node, the running time complexity of BST search is $O(h)$  where $h$  is the height of the tree. However, the worst case for BST search is $O(n)$  where $n$  is the total number of nodes in the BST, because an unbalanced BST may degenerate to a linked list. However, if the BST is height-balanced the height is $O(\log n)$ .: 290

#### Successor and predecessor

For certain operations, given a node ${\text{x}}$ , finding the successor or predecessor of ${\text{x}}$  is crucial. Assuming all the keys of the BST are distinct, the successor of a node ${\text{x}}$  in BST is the node with the smallest key greater than ${\text{x}}$ 's key. On the other hand, the predecessor of a node ${\text{x}}$  in BST is the node with the largest key smaller than ${\text{x}}$ 's key. Following is pseudocode for finding the successor and predecessor of a node ${\text{x}}$  in BST.: 292–293

  BST-Successor(x) if x.right ≠ NIL then return BST-Minimum(x.right) end if y := x.parent while y ≠ NIL and x = y.right then x := y y := y.parent repeat return y   BST-Predecessor(x) if x.left ≠ NIL then return BST-Maximum(x.left) end if y := x.parent while y ≠ NIL and x = y.left then x := y y := y.parent repeat return y 

Operations such as finding a node in a BST whose key is the maximum or minimum are critical in certain operations, such as determining the successor and predecessor of nodes. Following is the pseudocode for the operations.: 291–292

  BST-Maximum(x) while x.right ≠ NIL then x := x.right repeat return x   BST-Minimum(x) while x.left ≠ NIL then x := x.left repeat return x 

### Insertion

Operations such as insertion and deletion cause the BST representation to change dynamically. The data structure must be modified in such a way that the properties of BST continue to hold. New nodes are inserted as leaf nodes in the BST.: 294–295  Following is an iterative implementation of the insertion operation.: 294

 1 BST-Insert(T, z) 2 y := NIL 3 x := T.root 4 while x ≠ NIL do 5 y := x 6 if z.key < x.key then 7 x := x.left 8 else 9 x := x.right 10 end if 11 repeat 12 z.parent := y 13 if y = NIL then 14 T.root := z 15 else if z.key < y.key then 16 y.left := z 17 else 18 y.right := z 19 end if 

The procedure maintains a "trailing pointer" ${\text{y}}$  as a parent of ${\text{x}}$ . After initialization on line 2, the while loop along lines 4-11 causes the pointers to be updated. If ${\text{y}}$  is ${\text{nil}}$ , the BST is empty, thus ${\text{z}}$  is inserted as the root node of the binary search tree ${\text{T}}$ , if it is not ${\text{nil}}$ , insertion proceeds by comparing the keys to that of ${\text{y}}$  on the lines 15-19 and the node is inserted accordingly.: 295

### Deletion

Deletion of a node, say ${\text{z}}$ , from a binary search tree ${\text{T}}$  should abide three cases:: 295

1. If ${\text{z}}$  is a leaf node, the parent node's pointer to ${\text{z}}$  gets replaced with ${\text{nil}}$  and consequently ${\text{z}}$  gets removed from the tree.
2. If ${\text{z}}$  has a single child node, the child gets elevated as either left or right child of ${\text{z}}$ 's parent depending on the position of ${\text{z}}$  within the BST, as shown in fig. 2 part (a) and part (b), and as a result, ${\text{z}}$  gets removed from the tree.
3. If ${\text{z}}$  has both a left and right child, the successor of ${\text{z}}$  (let it be ${\text{y}}$ ) takes the position of ${\text{z}}$  in the tree. This depends on the position of ${\text{y}}$  within the BST:: 296
1. If ${\text{y}}$  is ${\text{z}}$ 's immediate right child, ${\text{y}}$  gets elevated and ${\text{y}}$ 's left child made point to ${\text{z}}$ 's initial left sub-tree, as shown in fig. 2 part (c).
2. If ${\text{y}}$  is not the immediate right child of ${\text{z}}$ , deletion proceeds by replacing the position of ${\text{y}}$  by its right child, and ${\text{y}}$  takes the position of ${\text{z}}$  in the BST, as shown in fig. 2 part (d).

Following is a pseudocode for the deletion operation in a binary search tree.: 296-298

 1 BST-Delete(T, z) 2 if z.left = NIL then 3 Shift-Nodes(T, z, z.right) 4 else if z.right = NIL then 5 Shift-Nodes(T, z, z.left) 6 else 7 y := Tree-Successor(z) 8 if y.parent ≠ z then 9 Shift-Nodes(T, y, y.right) 10 y.right := z.right 11 y.right.parent := y 12 end if 13 Shift-Nodes(T, z, y) 14 y.left := z.left 15 y.left.parent := y 16 end if  1 Shift-Nodes(T, u, v) 2 if u.parent = NIL then 3 T.root := v 4 else if u = u.parent.left then 5 u.parent.left := v 5 else 6 u.parent.right := v 7 end if 8 if v ≠ NIL then 9 v.parent := u.parent 10 end if 

The ${\text{Tree-Delete}}$  procedure deals with the 3 special cases mentioned above. Lines 2-3 deal with case 1; lines 4-5 deal with case 2 and lines 6-16 for case 3. The helper function ${\text{Shift-Nodes}}$  is used within the deletion algorithm for the purpose of replacing the node ${\text{u}}$  with ${\text{v}}$  in the binary search tree ${\text{T}}$ .: 298  This procedure handles the deletion (and substitution) of ${\text{u}}$  from the BST.

## Traversal

A BST can be traversed through three basic algorithms: inorder, preorder, and postorder tree walks.: 287

• Inorder tree walk: Nodes from the left subtree get visited first, followed by the root node and right subtree.
• Preorder tree walk: The root node gets visited first, followed by left and right subtrees.
• Postorder tree walk: Nodes from the left subtree get visited first, followed by the right subtree, and finally the root.

Following is a recursive implementation of the tree walks.: 287–289

  Inorder-Tree-Walk(x) if x ≠ NIL then Inorder-Tree-Walk(x.left) visit node Inorder-Tree-Walk(x.right) end if   Preorder-Tree-Walk(x) if x ≠ NIL then visit node Preorder-Tree-Walk(x.left) Preorder-Tree-Walk(x.right) end if   Postorder-Tree-Walk(x) if x ≠ NIL then Postorder-Tree-Walk(x.left) Postorder-Tree-Walk(x.right) visit node end if 

## Balanced binary search trees

Without rebalancing, insertions or deletions in a binary search tree may lead to degeneration, resulting in a height $n$  of the tree (where $n$  is number of items in a tree), so that the lookup performance is deteriorated to that of a linear search. Keeping the search tree balanced and height bounded by $O(\log n)$  is a key to the usefulness of the binary search tree. This can be achieved by "self-balancing" mechanisms during the updation operations to the tree designed to maintain the tree height to the binary logarithmic complexity.: 50

### Height-balanced trees

A tree is height-balanced if the heights of the left sub-tree and right sub-tree are guaranteed to be related by a constant factor. This property was introduced by the AVL tree and continued by the Red-Black tree.: 50–51  The heights of all the nodes on the path from the root to the modified leaf node have to be observed and possibly corrected on every insert and delete operation to the tree.: 52

### Weight-balanced trees

In a weight-balanced tree, the criterion of a balanced tree is the number of leaves of the subtrees. The weights of the left and right subtrees differ at most by $1$ .: 61  However, the difference is bound by a ratio $\alpha$  of the weights, since a strong balance condition of $1$  cannot be maintained with $O(\log n)$  rebalancing work during insert and delete operations. The $\alpha$ -weight-balanced trees gives an entire family of balance conditions, where each left and right subtrees have each at least a fraction of $\alpha$  of the total weight of the subtree.: 62

### Types

There are several self-balanced binary search trees, including T-tree, treap, red-black tree, B-tree, 2–3 tree, and Splay tree.

## Examples of applications

### Sort

Binary search trees are used in sorting algorithms such as tree sort, where all the elements are inserted at once and the tree is traversed at an in-order fashion. BSTs are also used in quicksort.

### Priority queue operations

Binary search trees are used in implementing priority queues, using the node's key as priorities. Adding new elements to the queue follows the regular BST insertion operation but the removal operation depends on the type of priority queue:

• If it is an ascending order priority queue, removal of an element with the lowest priority is done through leftward traversal of the BST.
• If it is a descending order priority queue, removal of an element with the highest priority is done through rightward traversal of the BST.