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

Delete a node from doubly linked list

Deletion operation in DLL is simpler when compared to SLL. Because we don't have to go in search of previous node of to-be-deleted node.  Here is how you delete a node Link previous node of node of to-be-deleted to next node. Link next node of node of to-be-deleted to previous node. Free the memory of node of to-be-deleted Simple, isn't it. The code can go like this. prevnode = delnode->prev; nextnode = delnode->next; prevnode->next = nextnode; nextnode->prev = prevnode; free(delnode); And that is it. The node delnode is deleted. But we should always consider boundary conditions. What happens if we are trying to delete the first node or last node? If first node is to be deleted, its previous node is NULL. Hence step 3 should not be used.  And also, once head is deleted, nextnode becomes head . Similarly if last node is to be deleted, nextnode is NULL. Hence step 4 is as strict NO NO. And we should set prevnode to tail. After we put these things together, we have...
Post a Comment
Read more

Binary tree deletion - non-recursive

In the previous post we have seen how to delete a node of a binary search tree using recursion. Today we will see how to delete a node of BST using a non-recursive function. Let us revisit the 3 scenarios here Deleting a node with no children just link the parent to NULL Deleting a node with one child link the parent to  non-null child of node to be deleted Deleting a node with both children select the successor of node to be deleted copy successor's value into this node delete the successor In order to start, we need a function to search for a node in binary search tree. Did you know that searching in  a BST is very fast, and is of the order O(logn). To search Start with root Repeat until value is found or node is NULL If the search value is greater than node branch to right If the search value is lesser than node branch to left.  Here is the function NODEPTR find_node (NODEPTR root,NODEPTR * parent, int delval) { NODEPTR nd = root; NODEPTR pa = root; if (ro...
Post a Comment
Read more

Function to sort an array using bubble sort

Quick and dirty way of sorting an array is bubble sort. It is very easy to write and follow. But please keep in mind that it is not at all effecient. #include<iostream> using std::cin; using std::cout; void readArray(int arr[],int sz); void printArray(int arr[],int sz); void sortArray(int arr[],int sz); void swap(int &a,int &b); int main() {    int sz;    cout<<"Size of the array=";    cin>>sz;    int arr[sz];    readArray(arr,sz);     sortArray(arr,sz);   cout<<"Sorted array is ";   printArray(arr,sz); } void readArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";       cin>>arr[i];   } } void printArray(int arr[],int sz) {  for(int i=0;i<sz;i++)    {       cout<<"arr["<<i<<"]=";    ...
Post a Comment
Read more