A binary search tree is a binary tree such that for each node p$,$ if node q is in its left subtree p$.$key $<$ q$.$key and if q is in its right subtree q$.$key $<$ p$.$key when the children are not Null.