BST is a labelled binary tree in which a left child of every node has value smaller then it's parent and right child has value larger then it's parent. It is applicable to each and every node of the tree