Binary search tree is a data structure that quickly allows us to maintain a sorted list of numbers.
The properties that separates a binary search tree from a regular binary tree are:
Finding the location of some specific element in a binary search tree.
Adding a new element to the binary search tree at the appropriate location so that the property of BST do not violate.
Deleting some specific node from a binary search tree. However, there can be various cases in deletion depending upon the number of children, the node have.