DefinitionIn a Binary Search tree:If the left subtree of any node is not empty, then the value of all the nodes in the left subtree is less than the v