A binary search tree is a special type of binary tree which have the following properties.
- Nodes that are smaller than the root will be in the left subtree.
- Nodes that are greater than the root will be the right subtree.
- It should not have duplicate nodes
- Both left and right subtree also should be binary search trees.