Q. Write down an algorithm to test whether a Binary Tree is a Binary Search Tree.
The algorithm to check whether a Binary tree is as Binary Search tree is as
while((tree->left !=null)&& (tree->right !=null))
if(tree->left < tree->root)
if(tree->right > tree->root)