## 1. Overview

**In this tutorial, we’ll explore the binary search tree (BST) data structure.**

First, we’ll start with an overview of how the BST works and when to use it, and then we’ll implement the fundamental operations of lookup, insertion, and traversal.

## 2. Binary Search Trees

Simply put, **a binary search tree is a data structure that allows for fast insertion, removal, and lookup of items while offering an efficient way to iterate them in sorted order.**

For these reasons, we use binary search trees when we need efficient ways to access or modify a collection while maintaining the order of its elements.

The fundamental feature of a binary search tree, as opposed to a simple binary tree, is that it satisfies the binary search property. This property states that, **for each node, its value must be less than the values in the right sub-tree and greater than those in the left sub-tree**:

As a result, lookup, insertion, and removal operations have a complexity of . The reason for this is that, when traversing the tree from root to leaf, we can discard half of the tree at each step, according to the input value being greater or less than the one in the current node.

For example, if we want to see if the tree on the left contains the value 9, we already know that we’ll only have to look in the right sub-tree of the root node, because 9 is greater than 8, the value of the root.

### 2.1. Lookup

Lookup on a binary search tree is performed by traversing the tree down from the root and by choosing, at each step, if we want to continue by going right or left.** We repeat this process until we find our value or the current node doesn’t have a right/left child.**

This is an implementation using recursion:

### 2.2. Insertion

When inserting an element in the tree, we first need to find the correct position to place it in, because the tree has to still satisfy the binary search property.

The algorithm ends up being very similar to the lookup operation, with the difference being that we create a new node, instead of returning *false*, when the current node has no child:

### 2.3. Traversal

Trees are non-linear data structures, meaning that an ordering of their elements is not defined by default. Instead, we can access its elements in different orders by using different traversal algorithms.

Obtaining the elements in ascending order is easily implemented in the context of a BST, as we simply need to perform depth-first in-order traversal:

Conversely, if we want to visit the elements in descending order, we have to use reverse in-order traversal. To do this, we’ll simply start our depth-first search on the right sub-tree. In practice, we just need to invert the references to and in our algorithm.

This operation has a time complexity of – because there are nodes in the tree and each one of them is only visited once.

## 3. Conclusion

In this quick article, we explored the basics of how binary search trees work and why they can be quite useful.

We’ve also seen how to find and insert elements, and how to print them in ascending or descending order using depth-first in-order or reverse in-order traversal.

In insertion algorithm, key equals node scenario is missing, can you please add that also. Thanks

Hi Abhishek,

If the key already exists, the node won’t be added, as duplicates are not allowed in a BST. See the “Result” description in the algorithm.

Cheers.