isBST_or_not.cpp

//Pseudo code to check whether a binary tree is Binary Search Tree or not
bool checkBST(Node* root,int min,int max){
  if(root == NULL)return true;
  if(root->data > min && root->data < max && checkBST(root->left,min,root->data) && checkBST(root->right,root->data,max))
    return true;
  else return false;
}
  
isBST(Node* root){
  return checkBST(root, INT_MIN, INT_MAX);
}

//##We can also do the Inorder traversal of the binary search tree as the Inorder traversal of BST is sorted and thus can Find BST.