Skip to main content

Stack with find minimum function

Question : Implement a stack which finds the minimum of elements in the stack. All the three functions push(), pop() and findmin() must have time complexity of O(1)

This is one of the common questions asked in interviews.

The problem is finding minimum requires you to traverse through the stack, which is not possible without popping elements. So you can pop elements, find minimum and then push the elements back.

But the requirement says that findmin() function must have a constant complexity - O(1).

You can achieve this with the help of one more stack, to store minimum values.

Let us call this minstack. This is how the operations will work

push - 

  • push a value to stack
  • compare the value with top of minstack
    • if value is smaller than minstack top element push it to minstack
    • if not push minstack top element again to minstack

pop 

  • pop a value from stack
  • pop a value from minstack

findmin

  • get the value from minstack without popping it (peek)
 So this way we can have all three functions with O(1) time complexity. Here is our code


#include<stdio.h>  
#include<stdlib.h>
#define ERROR -1000
 struct node  
 {  
   int value;  
   struct node *next;   
 };  
 typedef struct node * NODEPTR;  
 
 NODEPTR create_node(int value)  
 {  
   NODEPTR temp = (NODEPTR) malloc(sizeof(struct node));  
    temp->next = NULL;  
   temp->value= value;  
   return temp;  
 } 
 NODEPTR push(NODEPTR top,int val)
 { 
     NODEPTR newnode = create_node(val);
     newnode->next = top;
     top = newnode;
     return top;
}
int isempty(NODEPTR top)
{
   return top==NULL;
}
int pop(NODEPTR *topPtr)
{
   if(isempty(*topPtr))
       return ERROR;
   int num = (*topPtr)->value;
   NODEPTR temp = *topPtr;
   *topPtr = (*topPtr)->next;
   free(temp);
   return num;
}
int peek(NODEPTR nd)
{
   return nd->value;
 }

void push1(NODEPTR*topptr,NODEPTR* mintopptr,int val)
{
     int minval =val;
     if(*mintopptr!=NULL)
        {
    int temp = peek(*mintopptr);
           if (temp<minval)
               minval = temp;
        }
     *topptr = push(*topptr,val);
     *mintopptr = push(*mintopptr,minval);
 }

 int pop1(NODEPTR* topptr,NODEPTR *mintopptr)
 {
   if(!isempty(*topptr))
   {
    pop(mintopptr);
    return pop(topptr);
   }else
       return -1;
 }
      
int findmin(NODEPTR mintop)
{
   if(mintop==NULL)
      return -1;
   return mintop->value;
}   

 int main()  
 {  
     NODEPTR top = NULL;//stack
     NODEPTR nd;
     NODEPTR mintop=NULL;//minstack

     while(1)
     {  
       int option,value; 
       printf("Enter 1- push 2- pop 3 - exit 4- find minimum"); 
       scanf("%d",&option);
       if(option==3)
          break;
       switch(option)
       {
           case 1:  printf("new value to push=");  
             scanf("%d",&value);   
                    push1(&top,&mintop,value);
                    break;
           case 2:  value = pop1(&top,&mintop);
                    if(value==ERROR)
                         printf("Stack empty\n");
                    else
    printf("Value popped is %d\n",value);
                    break; 
           case 4:  value=findmin(mintop);
                    if(value==-1)
                        printf("Stack empty\n");
                    else
                    printf("Minimum of stack is %d\n",value);
             
                    break;
        }  
    }     
 }

Notes
  1. We are implementing the stack using a linked list
  2. push1() function is used for pushing the value to both the stack and minstack. pop1 is used for popping values.
Labels:

Comments

Post a Comment

Popular posts from this blog

Introduction to AVL tree

AVL tree is a balanced binary search tree where the difference between heights of two sub trees is maximum 1. Why balanced tree A binary tree is good data structure because search operation here is of the order of O(logn). But this is true if the tree is balanced - which means the left and right subtrees are almost equal in height. If not balanced, search operation will take longer.  In worst case, if the tree has only one branch, then search is of the order O(n). Look at this example.  Here all nodes have only right children.  To search a value in this tree, we need upto 7 iterations, which is O(n). So this tree is very very inefficient. One way of making the tree efficient is to, balance the tree and make sure that height of two branches of each node are almost equal. Height of a node Height of a node is the distance between the node and its extreme child.  In the above a diagram, height of 37 is 3 and height of left child of 37 is 0 and right child of 37 is 2. Bal...
Post a Comment
Read more

Balanced brackets

Have you observed something? When ever you are writing code using any IDE, if you write mismatched brackets, immediately an error is shown by IDE. So how does IDE  know if an expression is having balanced brackets? For that, the expression must have equal number of opening and closing brackets of matching types and also they must be in correct order. Let us look at some examples (a+b)*c+d*{e+(f*g)}   - balanced (p+q*[r+u )] - unbalanced (p+q+r+s) ) - unbalanced (m+n*[p+q]+{g+h}) - balanced So we do we write a program to check if an expression is having balanced brackets? We do need to make use of stack to store the brackets. The algorithm is as follows Scan a character - ch from the expression If the character is opening bracket, push it to stack If the character is closing bracket pop a character from stack If popped opening bracket and ch are not of same type ( ( and ) or [ and ] ) stop the function and return false Repeat steps 2 and 3 till all characters are scanned. On...
2 comments
Read more

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