What is Stack in Data Structure ?<\/h2>\n<\/div>\n<\/div>\n

\n

\n

\n
• A stack is a container of objects that are performed based on last-in first-out (LIFO) principle.<\/li>\n
• A stack is a limited access data structure-elements can be added and removed from the stack only at the top. A stack is a recursive data structure.<\/li>\n
• The structural definition of a Stack is either empty or it consists of a top and the rest.<\/li>\n
• There are two basic operations performed in a Stack they are:<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
  \n

  \n

  \n
  • \n
    \n
    • Push()<\/li>\n
    • Pop()<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n
      \n

      \n

      \n
      • \n
        \n
        • Push()-push function is used to add or insert new item into the stack.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n
          \n

          <\/div>\n<\/div>\n

          \n
          • \n
            \n
            • Pop()-pop function is used to delete or remove an item from the stack.<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n
              \n

              <\/div>\n<\/div>\n

              \n
              • When a stack is completely full, it is said to be Overflow state and if stack is completely empty, it is said to be Underflow state.<\/li>\n
              • Stack allows operations at one end only.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
                \n

                \n

                Other operations used in Stack<\/h2>\n<\/div>\n<\/div>\n

                \n

                \n

                \n
                • Peek()-The peek() function gets the top element of the stack, without deleting it.<\/li>\n
                • isEmpty() -The isEmpty() function checks whether the stack is empty or not.<\/li>\n
                • isFull()-The isFull() function is used to check whether the stack is full or not.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
                  \n

                  \n

                  Features of stacks<\/h2>\n<\/div>\n<\/div>\n

                  \n

                  \n

                  \n
                  • Dynamic data structures<\/li>\n
                  • Do not have a fixed size<\/li>\n
                  • Do not consume a fixed amount of memory<\/li>\n
                  • Size of stack changes with each push() and pop() operation. Each push() and pop() operation increases and decreases the size of the stack by 1, respectively.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n
                    \n

                    \n

                    Implementation of Stack<\/h2>\n<\/div>\n<\/div>\n

                    \n

                    <\/div>\n

                    \n

                    Sample Code<\/h2>\n

                    <\/div>

                    import java.io.*;\/* Java program to implement basic stack operations *\/class Stack {     static final int MAX = 1000;     int top;     int a[] = new int[MAX]; \/\/ Maximum size of Stack       boolean isEmpty()     {         return (top < 0);     }     Stack()     {         top = -1;     }       boolean push(int b)     {         if (top >= (MAX-1))         {             System.out.println("Stack Overflow");             return false;         }         else        {             a[++top] = b;             System.out.println(b + " pushed into the stack");             return true;         }     }       int pop()     {         if (top < 0)         {             System.out.println("Stack Underflow");             return 0;         }         else        {             int b = a[top--];             return b;         }     } }   \/\/ Driver code class Main {     public static void main(String args[])     {         Stack s1 = new Stack();         s1.push(80);         s1.push(75);         s1.push(90);         System.out.println(s1.pop() + " Popped from the stack");     } }<\/code><\/pre> <\/div>\n
                    Output<\/h2>\n<\/div>\n
                     
                     <\/div> 
                    80 pushed into the stack75 pushed into the stack90 pushed into the stack80 Popped from the stack<\/code><\/pre> <\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
                    Answer : A stack is a container of objects that are performed…<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[3028],"tags":[195,3329,971,15897,3318,3325,491,3331,221,368,203,199,214,198,363,3057,3337,205,222,484,3054,196,212,207,366,204,15928,3342,3326,3319,3327,206,972,3332,3323,3324,3341,3340,3343,3322,3328,3320,3330,3336,3339,3344,3338,3345,200,3055,197,3346,3348,3321,3317,968,3056,285,969],"class_list":["post-487","post","type-post","status-publish","format-standard","hentry","category-data-structure","tag-accenture-interview-questions-and-answers","tag-algorithm-for-push-and-pop-operation-in-stack-in-c","tag-altimetrik-india-pvt-ltd-interview-questions-and-answers","tag-apostek-software-interview-questions-and-answers","tag-application-of-stack-in-data-structure","tag-applications-of-stack-in-real-life","tag-applied-materials-interview-questions-and-answers","tag-array-representation-of-stack","tag-bharti-airtel-interview-questions-and-answers","tag-bmc-software-interview-questions-and-answers","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-collabera-te-interview-questions-and-answers","tag-data-stack","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-flipkart-interview-questions-and-answers","tag-genpact-interview-questions-and-answers","tag-globallogic-india-pvt-ltd-interview-questions-and-answers","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-mphasis-interview-questions-and-answers","tag-netapp-interview-questions-and-answers","tag-oracle-corporation-interview-questions-and-answers","tag-paramatrix-interview-questions-and-answers","tag-push-and-pop","tag-push-and-pop-operation-in-stack-in-c-program","tag-push-and-pop-operation-in-stack-in-data-structure","tag-push-and-pop-operation-in-stack-in-data-structure-program","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-sapient-consulting-pvt-ltd-interview-questions-and-answers","tag-stack-applications-in-data-structure","tag-stack-data-structure-in-c","tag-stack-data-structure-java","tag-stack-definition","tag-stack-implementation-in-java","tag-stack-in-c","tag-stack-in-data-structure","tag-stack-in-data-structure-with-example","tag-stack-operations","tag-stack-operations-in-capplication-of-stack","tag-stack-pop","tag-stack-program","tag-stack-push","tag-stack-push-pop","tag-stacking-containers","tag-tech-mahindra-interview-questions-and-answers","tag-tracxn-technologies-pvt-ltd-interview-questions-and-answers","tag-unitedhealth-group-interview-questions-and-answers","tag-what-is-meant-by-stack","tag-what-is-stack-data-structure","tag-what-is-stack-in-c","tag-what-is-stack-in-data-structure","tag-wipro-infotech-interview-questions-and-answers","tag-wm-global-technology-services-india-pvt-ltd-limited-wmgts-interview-questions-and-answers","tag-xoriant-solutions-pvt-ltd-interview-questions-and-answers","tag-yodlee-infotech-pvt-ltd-interview-questions-and-answers"],"yoast_head":"\n