## Check for BST

Problem Statement Given a binary tree, we have to determine if the tree is a binary search tree or not.A tree is said to be a valid binary search tree when, Example consider the following examplesexample-1 output: example-2 output: Example Explanation In example 1,Condition 1 is not satisfied. All the nodes in the left subtree ...