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

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