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;
}
Labels:

Comments

Post a Comment

Popular posts from this blog

Program to delete a node from linked list

How do you remove a node from a linked list? If you have to delete a node, first you need to search the node. Then you should find its previous node. Then you should link the previous node to the next node. If node containing 8 has to be deleted, then n1 should be pointing to n2. Looks quite simple. Isn't it? But there are at least two special cases you have to consider. Of course, when the node is not found. If the node is first node of the list viz head. If the node to be deleted is head node, then if you delete, the list would be lost. You should avoid that and make the second node as the head node. So it becomes mandatory that you return the changed head node from the function.   Now let us have a look at the code. #include<stdio.h> #include<stdlib.h> struct node { int data; struct node * next; }; typedef struct node * NODEPTR; NODEPTR create_node ( int value) { NODEPTR temp = (NODEPTR) malloc( size...
3 comments
Read more

Binary tree deletion

Do not get all scared and worried. It is not rocket science (or as I would like to call it - it is not regex). Remember deleting a node from linked list. When you deleted a node, you did the following 2 steps Free the memory of the node Link the previous node of the deleted node to the next node You will have to do these things in binary tree too. But the difficulty here is do you link the previous node - or parent node in tree terminology, to the left child of deleted node? Or to the right child? You can not link both children, as the parent already may have one child node. So before we solve this, let us categorize the deletion with the help of a diagram. Consider the cases The node to be deleted is a leaf node. That is, it does not have left or right child. In this case, link the parent to NULL in place of deleted node.  If you want to delete 13 - which is a leaf node, you set 14->left to NULL and free memory of node 13. If you want to delete 7 - which is also a leaf node and...
Post a Comment
Read more

Deletion of a node from linked list given only that node

We have considered how to create and print the list and delete a node from a list. But often interviewers ask you a question, given a node of the list, how do you delete that node? The problem here is we do not know the head of the list. We just the know one node which we must delete. Well, the solution is much simpler than it appears. Suppose 12 is the node which should be deleted. As we can see from the diagram, we are deleting the next node of 99 by the usual method of linking n to next of next of 12. But the requirement was not to delete next node  but the node with 12 itself. So we will retain the data of that node (99) by copying it to previous node. And now the node with 99 is marked for deletion. Which can be easily deleted as follows. We are assuming that n is the node with 12 as value. n -> data = n -> next -> data; //copy the data n -> next = n -> next -> next; //link to next free( n -> next) ; //delete next of n   ...
Post a Comment
Read more