search
HomeBackend DevelopmentC++Stack Data Structure | Last In First Out (LIFO)

  1. - Push (Add an Element): Add an element to the top of the stack.
  2. - Pop (Remove an Element): Remove the element from the top.
  3. - isFull: Check if the stack has reached its limit (in this case, 10).
  4. - isEmpty: Check if the stack is empty.
  5. - Display: Display the stack elements.

1.Example:
index.html


  
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>Stack | Last In First Out (LIFO) or First in Last out | - By Sudhanshu Gaikwad (FILO)</title>
  
  
    <h3 id="Stack-in-Javascript">Stack in Javascript</h3>
    <script>
      let Data = [];

      // Add an element to the array
      function AddEle(Ele) {
        if (isFull()) {
          console.log("Array is Full, Element can't be added!");
        } else {
          console.log("Element Added!");
          Data.push(Ele);
        }
      }

      // Check if the array is full
      function isFull() {
        return Data.length >= 10;
      }

      // Remove an element from the array
      function Remove() {
        if (isEmpty()) {
          console.log("Array is Empty, can't remove element!");
        } else {
          Data.pop();
          console.log("Element Removed!");
        }
      }

      // Check if the array is empty
      function isEmpty() {
        return Data.length === 0;
      }

      // Display the array elements
      function Display() {
        console.log("Updated Array >> ", Data);
      }

      // Example usage
      AddEle(55);
      AddEle(85);
      AddEle(25);
      Remove();
      Display(); // [55, 85]
    </script>
  


2.Example:
index2.html


  
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <title>What is Stack in JavaScript | By Sudhanshu Gaikwad</title>
    <style>
      * {
        box-sizing: border-box;
      }

      body {
        font-family: "Roboto Condensed", sans-serif;
        background-color: #f4f4f4;
        margin: 0;
        padding: 0;
        display: flex;
        flex-direction: column;
        justify-content: center;
        align-items: center;
        height: 100vh;
      }

      .container {
        background-color: white;
        padding: 20px;
        border-radius: 10px;
        box-shadow: 0 4px 8px rgba(0, 0, 0, 0.1);
        max-width: 400px;
        width: 100%;
        margin-bottom: 20px;
      }

      h3 {
        color: #333;
        text-align: center;
        margin-bottom: 20px;
      }

      input {
        padding: 10px;
        width: calc(100% - 20px);
        margin-bottom: 10px;
        border: 1px solid #ccc;
        border-radius: 5px;
      }

      button {
        padding: 10px;
        margin: 10px 0;
        border: none;
        border-radius: 5px;
        background-color: #292f31;
        color: white;
        cursor: pointer;
        width: 100%;
      }

      button:hover {
        background-color: #e9e9ea;
        color: #292f31;
      }

      .message {
        margin-top: 15px;
        color: #333;
        font-size: 16px;
        text-align: center;
      }

      .footer {
        text-align: center;
        margin-top: 20px;
        font-size: 14px;
        color: #555;
      }

      /* Responsive design */
      @media (max-width: 768px) {
        .container {
          padding: 15px;
          max-width: 90%;
        }

        button {
          font-size: 14px;
        }

        input {
          font-size: 14px;
        }
      }
    </style>
  

  
    <div class="container">
      <!-- Title -->
      <h3 id="Stack-in-JavaScript">Stack in JavaScript</h3>

      <!-- Input section -->
      <input type="text" id="AddEle" placeholder="Enter an element">

      <!-- Buttons section -->
      <button onclick="AddData()">Add Element</button>
      <button onclick="RemoveEle()">Remove Element</button>
      <button onclick="Display()">Show Array</button>

      <!-- Message sections -->
      <div id="Add" class="message"></div>
      <div id="Remove" class="message"></div>
      <div id="Display" class="message"></div>
    </div>

    <!-- Footer with copyright symbol -->
    <div class="footer">
      © 2024 Sudhanshu Developer | All Rights Reserved
    </div>

    <script>
      let Data = [];

      // Function to add an element to the stack
      function AddData() {
        let NewEle = document.getElementById("AddEle").value;

        if (isFull()) {
          document.getElementById("Add").innerHTML = "Array is full, element cannot be added!";
        } else if (NewEle.trim() === "") {
          document.getElementById("Add").innerHTML = "Please enter a valid element!";
        } else {
          Data.push(NewEle);
          document.getElementById("Add").innerHTML = `Element "${NewEle}" added!`;
          document.getElementById("AddEle").value = ""; 
          console.log("Current Array: ", Data); 
          Display(); 
        }
      }

      function isFull() {
        return Data.length >= 10;
      }

      function RemoveEle() {
        if (isEmpty()) {
          document.getElementById("Remove").innerHTML = "Array is empty!";
        } else {
          let removedElement = Data.pop();
          document.getElementById("Remove").innerHTML = `Element "${removedElement}" removed!`;
          console.log("Current Array: ", Data);
          Display(); 
        }
      }

      function isEmpty() {
        return Data.length === 0;
      }

      function Display() {
        let displayArea = document.getElementById("Display");
        displayArea.innerHTML = ""; 
        if (Data.length === 0) {
          displayArea.innerHTML = "No elements in the Array!";
          console.log("Array is empty.");
        } else {
          for (let i = 0; i < Data.length; i++) {
            displayArea.innerHTML += `Element ${i + 1}: ${Data[i]}<br>`;
          }
          console.log("Displaying Array: ", Data); 
        }
      }
    </script>
  


Output:

Stack Data Structure | Last In First Out (LIFO)

Stack in C Language with User Input

#include <stdio.h>
#include <stdbool.h>

#define MAX 10 

int Data[MAX];
int top = -1;  

// Function to check if the stack is full
bool isFull() {
    return top >= MAX - 1;
}

// Function to check if the stack is empty
bool isEmpty() {
    return top == -1;
}

// Function to add an element to the stack (Push operation)
void AddEle() {
    int Ele;
    if (isFull()) {
        printf("Array is Full, Element can't be added!\n");
    } else {
        printf("Enter an element to add: ");
        scanf("%d", &Ele); // Read user input
        Data[++top] = Ele; // Increment top and add element
        printf("Element %d Added!\n", Ele);
    }
}

// Function to remove an element from the stack (Pop operation)
void Remove() {
    if (isEmpty()) {
        printf("Array is Empty, can't remove element!\n");
    } else {
        printf("Element %d Removed!\n", Data[top--]); // Remove element and decrement top
    }
}

// Function to display all elements in the stack
void Display() {
    if (isEmpty()) {
        printf("Array is Empty!\n");
    } else {
        printf("Updated Array >> ");
        for (int i = 0; i 



<p><strong>Example Output:</strong><br>
</p>

<pre class="brush:php;toolbar:false">1. Add Element
2. Remove Element
3. Display Stack
4. Exit
Enter your choice: 1
Enter an element to add: 55
Element 55 Added!

1. Add Element
2. Remove Element
3. Display Stack
4. Exit
Enter your choice: 3
Updated Array >> 55 

1. Add Element
2. Remove Element
3. Display Stack
4. Exit
Enter your choice: 4
Exiting...

The above is the detailed content of Stack Data Structure | Last In First Out (LIFO). For more information, please follow other related articles on the PHP Chinese website!

Statement
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Mastering Polymorphism in C  : A Deep DiveMastering Polymorphism in C : A Deep DiveMay 14, 2025 am 12:13 AM

Mastering polymorphisms in C can significantly improve code flexibility and maintainability. 1) Polymorphism allows different types of objects to be treated as objects of the same base type. 2) Implement runtime polymorphism through inheritance and virtual functions. 3) Polymorphism supports code extension without modifying existing classes. 4) Using CRTP to implement compile-time polymorphism can improve performance. 5) Smart pointers help resource management. 6) The base class should have a virtual destructor. 7) Performance optimization requires code analysis first.

C   Destructors vs Garbage Collectors : What are the differences?C Destructors vs Garbage Collectors : What are the differences?May 13, 2025 pm 03:25 PM

C destructorsprovideprecisecontroloverresourcemanagement,whilegarbagecollectorsautomatememorymanagementbutintroduceunpredictability.C destructors:1)Allowcustomcleanupactionswhenobjectsaredestroyed,2)Releaseresourcesimmediatelywhenobjectsgooutofscop

C   and XML: Integrating Data in Your ProjectsC and XML: Integrating Data in Your ProjectsMay 10, 2025 am 12:18 AM

Integrating XML in a C project can be achieved through the following steps: 1) parse and generate XML files using pugixml or TinyXML library, 2) select DOM or SAX methods for parsing, 3) handle nested nodes and multi-level properties, 4) optimize performance using debugging techniques and best practices.

Using XML in C  : A Guide to Libraries and ToolsUsing XML in C : A Guide to Libraries and ToolsMay 09, 2025 am 12:16 AM

XML is used in C because it provides a convenient way to structure data, especially in configuration files, data storage and network communications. 1) Select the appropriate library, such as TinyXML, pugixml, RapidXML, and decide according to project needs. 2) Understand two ways of XML parsing and generation: DOM is suitable for frequent access and modification, and SAX is suitable for large files or streaming data. 3) When optimizing performance, TinyXML is suitable for small files, pugixml performs well in memory and speed, and RapidXML is excellent in processing large files.

C# and C  : Exploring the Different ParadigmsC# and C : Exploring the Different ParadigmsMay 08, 2025 am 12:06 AM

The main differences between C# and C are memory management, polymorphism implementation and performance optimization. 1) C# uses a garbage collector to automatically manage memory, while C needs to be managed manually. 2) C# realizes polymorphism through interfaces and virtual methods, and C uses virtual functions and pure virtual functions. 3) The performance optimization of C# depends on structure and parallel programming, while C is implemented through inline functions and multithreading.

C   XML Parsing: Techniques and Best PracticesC XML Parsing: Techniques and Best PracticesMay 07, 2025 am 12:06 AM

The DOM and SAX methods can be used to parse XML data in C. 1) DOM parsing loads XML into memory, suitable for small files, but may take up a lot of memory. 2) SAX parsing is event-driven and is suitable for large files, but cannot be accessed randomly. Choosing the right method and optimizing the code can improve efficiency.

C   in Specific Domains: Exploring Its StrongholdsC in Specific Domains: Exploring Its StrongholdsMay 06, 2025 am 12:08 AM

C is widely used in the fields of game development, embedded systems, financial transactions and scientific computing, due to its high performance and flexibility. 1) In game development, C is used for efficient graphics rendering and real-time computing. 2) In embedded systems, C's memory management and hardware control capabilities make it the first choice. 3) In the field of financial transactions, C's high performance meets the needs of real-time computing. 4) In scientific computing, C's efficient algorithm implementation and data processing capabilities are fully reflected.

Debunking the Myths: Is C   Really a Dead Language?Debunking the Myths: Is C Really a Dead Language?May 05, 2025 am 12:11 AM

C is not dead, but has flourished in many key areas: 1) game development, 2) system programming, 3) high-performance computing, 4) browsers and network applications, C is still the mainstream choice, showing its strong vitality and application scenarios.

See all articles

Hot AI Tools

Undresser.AI Undress

Undresser.AI Undress

AI-powered app for creating realistic nude photos

AI Clothes Remover

AI Clothes Remover

Online AI tool for removing clothes from photos.

Undress AI Tool

Undress AI Tool

Undress images for free

Clothoff.io

Clothoff.io

AI clothes remover

Video Face Swap

Video Face Swap

Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

SAP NetWeaver Server Adapter for Eclipse

SAP NetWeaver Server Adapter for Eclipse

Integrate Eclipse with SAP NetWeaver application server.

MinGW - Minimalist GNU for Windows

MinGW - Minimalist GNU for Windows

This project is in the process of being migrated to osdn.net/projects/mingw, you can continue to follow us there. MinGW: A native Windows port of the GNU Compiler Collection (GCC), freely distributable import libraries and header files for building native Windows applications; includes extensions to the MSVC runtime to support C99 functionality. All MinGW software can run on 64-bit Windows platforms.

Zend Studio 13.0.1

Zend Studio 13.0.1

Powerful PHP integrated development environment

ZendStudio 13.5.1 Mac

ZendStudio 13.5.1 Mac

Powerful PHP integrated development environment

mPDF

mPDF

mPDF is a PHP library that can generate PDF files from UTF-8 encoded HTML. The original author, Ian Back, wrote mPDF to output PDF files "on the fly" from his website and handle different languages. It is slower than original scripts like HTML2FPDF and produces larger files when using Unicode fonts, but supports CSS styles etc. and has a lot of enhancements. Supports almost all languages, including RTL (Arabic and Hebrew) and CJK (Chinese, Japanese and Korean). Supports nested block-level elements (such as P, DIV),