Introduction to a Binary Search Tree (BST)

What is a BST?

A BST or a binary search tree is a binary tree in which nodes are ordered in the following way:

• The key in the left node is less than the key in its parent node.
• The key in the right node is greater than the key in its parent node.
• No duplicate key is allowed.

Let’s look at the following figure to better understand a BST.