Binary Search Tree are binary trees which follows the following property $\text{value of left node < value of root < value of right node}$