CHECK FOR BST
bool isBSTUtil(Node* root, int min, int max){
if(root == NULL)
return true;
if(root->data < min || root->data > max)
return false;
return isBSTUtil(root->left, min, root->data-1) && isBSTUtil(root->right, root->data+1, max);
}
bool isBST(Node* root)
{
return isBSTUtil(root, INT_MIN, INT_MAX);
}
No comments:
Post a Comment