Skip to main content

Test whether a binary tree is a BST

This is one of the interview questions.

Given a binary tree, find out whether it is a binary search tree.

A binary search tree is an ordered binary tree which satisfies  binary search tree property, which states that the key in each node must be greater than or equal to any key stored in the left sub-tree, and less than or equal to any key stored in the right sub-tree.

A binary Search Tree
  This diagram shows a BST, because each node has key value larger than left subtree and smaller than right subtree.
Binary Tree but not a Binary search tree

This is not a binary search tree because key value of left child of root is larger than 2. And key value of node 7 is has a right child whose value is lesser than 7.

How to write a function

If the in order traversal output does not give key values in ascending order, then the tree is not a binary search tree.

But inorder is a recursive function. So we can not directly compare values. We need to use a global variable to store the value of a node. And as node is visited, it is compared with this global variable - say prevValue. If value of node is smaller than prevValue, then tree is not a BST.

This property must be tested on left and right subtrees also. If left subtree or right subtree is not a BST, then we return false (or 0 in C).

Here is the function

int isBST(NODEPTR nd)
{

if(nd!=NULL)
{
if(!isBST(nd->left))
return 0;
if(nd->val<prevValue)
return 0;
prevValue = nd->val;
return isBST(nd->right);
}
else
return 1;
}

And here is complete program. I have created two trees - one BST and another non-bst. The nodes have to linked explicitly because the ordinary insert methods rely on BST property and would create a BST always.


#include<stdio.h>
#include<stdlib.h>
struct node
{
int val;
struct node *left;
struct node *right;
};
typedef struct node *NODEPTR;
static int prevValue;
NODEPTR create_node(int num)
{
NODEPTR temp = (NODEPTR)malloc(sizeof(struct node));
temp->val = num;
temp->left = NULL;
temp->right = NULL;
return temp;
}

NODEPTR insert_node(NODEPTR nd,NODEPTR newnode)
{
if(nd==NULL)
return newnode;/* newnode becomes root of tree*/
if(newnode->val > nd->val)
nd->right = insert_node(nd->right,newnode);
else if(newnode->val < nd->val)
nd->left = insert_node(nd->left,newnode);
return nd;
}
NODEPTR create_tree1()
{
NODEPTR n1,n2,n3,n4,n5,n6,n7,root;
n1 = create_node(10);
n2 = create_node(20);
n3 = create_node(30);
n4 = create_node(40);
n5 = create_node(50);
n6 = create_node(60);
n7 = create_node(70);
root = n3;
n3->left = n1;
n1->right = n2;
n3->right = n6;
n6->left = n4;
n4->right = n5;
n6->right = n7;
return root;
}
NODEPTR create_tree2()
{
NODEPTR n1,n2,n3,n4,n5,n6,n7,root;
n1 = create_node(10);
n2 = create_node(20);
n3 = create_node(30);
n4 = create_node(40);
n5 = create_node(50);
n6 = create_node(60);
n7 = create_node(70);
root = n3;
n3->left = n1;
n1->left = n2;
n3->right = n6;
n6->left = n4;
n4->right = n5;
n6->right = n7;
return root;
}

void in_order(NODEPTR nd)
{
if(nd!=NULL)
{
in_order(nd->left);
printf("%d---",nd->val);
in_order(nd->right);
}
}
int isBST(NODEPTR nd)
{

if(nd!=NULL)
{
if(!isBST(nd->left))
return 0;
if(nd->val<prevValue)
return 0;
prevValue = nd->val;
return isBST(nd->right);
}
else
return 1;
}


int main()
{
NODEPTR root=NULL,delnode;
int n;
root = create_tree1();
printf("\nInorder traversal\n");
in_order(root);
if(isBST(root))
printf("The tree is a binary search tree");
else
printf("The tree is not a binary search tree");
root =create_tree2();
in_order(root);
if(isBST(root))
printf("this tree is a binary search tree");
else
printf("this tree is not a binary search tree");

return 0;
}

Comments

Popular posts from this blog

Josephus problem

Question: Write a function to delete every k th node from circular linked list until only one node is left. This has a story associated with it. Flavius Josephus was Jewish Historian from 1st century. He and 40 other soldiers were trapped in a cave by Romans. They decided to kill themselves rather than surrendering to Romans. Their method was like this. All the soldiers will stand in a circle and every k th soldier will be shot dead. Josephus said to have calculated the starting point so that he would remain alive. So we have similar problem at hand. We delete every kth node in a circular list. Eventually only one node will be left. e.g. Let us say this is our list And we are deleting every third node.  We will delete 30. Then we delete 60. Next we delete 10. Next it will be 50. Next to be deleted is 20. Next 80. This continues. Implementation   We can count k-1 nodes and delete next node. This can be repeated in  a loop. What must be the termina...

Lowest common ancestor of binary search tree

Question : Write a function to print the lowest common ancestor of two nodes in a binary search tree.  Lowest common ancestor of two nodes x and y in a binary tree is the lowest node that has both x and y as descendants. Here lowest common ancestor of 1 and 7 is 3. LCA of 13 and 7 is root - 8. And LCA of 6 and 7 is 6 itself. The program to find gets complicated for an ordinary binary tree. But for a binary search tree, it is quite simple. As we see from the diagram above, the paths to 1 and 4 are common till the node 3. And at 3 they branch in different directions. So 3 is our LCA. That is lowest common ancestor is the node where the paths to x and y from root deviate. As long as they branch in same direction, we continue to traverse. When they branch in different directions, that is the lowest common ancestor. So let us write a simple algorithm, set temp=root if temp->val >x and temp->val>y temp = temp->left else if temp->val<x and ...

In order traversal of nodes in the range x to y

Question : Write a function for in-order traversal of nodes in the range x to y from a binary search tree. This is quite a simple function. As a first solution we can just traverse our binary search tree in inorder and display only the nodes which are in the range x to y. But if the current node has a value less than x, do we have to traverse its left subtree? No. Because all the nodes in left subtree will be smaller than x. Similarly if the current node has a key value more than y, we need not visit its right subtree. Now we are ready to write our algorithm.     if nd is NOT NULL  if nd->val >=x then visit all the nodes of left subtree of nd recursively display nd->val if nd->val <y then visit all the nodes of right subtree of nd recursively  That's all. We have our function ready. void in_order_middle (NODEPTR nd, int x, int y) { if (nd) { if (nd -> val >= x) in_order_middle(nd...