Scribd Logo
Upload

Welcome to Scribd!

  • Data Structure and Algorithms - Stack

    Uploaded by

    Bharti Patel
    15 views3 pages
    A stack is a last-in, first-out data structure that can insert and remove items from only one end. It uses pointers to track the top element, allowing push to insert and pop to remove the top item without rearranging others. Common stack operations include push to add, pop to remove, peek to view without removing, and checks for empty and full.

    Original Description:

    Data structure

    Original Title

    L 12-13

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A stack is a last-in, first-out data structure that can insert and remove items from only one end. It uses pointers to track the top element, allowing push to insert and pop to remove the top item without rearranging others. Common stack operations include push to add, pop to remove, peek to view without removing, and checks for empty and full.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    15 views3 pages

    Data Structure and Algorithms - Stack

    Uploaded by

    Bharti Patel
    A stack is a last-in, first-out data structure that can insert and remove items from only one end. It uses pointers to track the top element, allowing push to insert and pop to remove the top item without rearranging others. Common stack operations include push to add, pop to remove, peek to view without removing, and checks for empty and full.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 3

    Data Structure and Algorithms - Stack

    A stack is an Abstract Data Type (ADT), that is popularly used in most


    programming languages. It is named stack because it has the similar operations as
    the real-world stacks, for example – a pack of cards or a pile of plates, etc.

    The stack follows the LIFO (Last in - First out) structure where the last element
    inserted would be the first element deleted.

    Stack Representation
    A Stack ADT allows all data operations at one end only. At any given time, we can
    only access the top element of a stack.

    The following diagram depicts a stack and its operations −

    A stack can be implemented by means of Array, Structure, Pointer, and Linked


    List. Stack can either be a fixed size one or it may have a sense of dynamic
    resizing. Here, we are going to implement stack using arrays, which makes it a
    fixed size stack implementation.
    Basic Operations on Stacks
    Stack operations usually are performed for initialization, usage and, de-
    initialization of the stack ADT.

    The most fundamental operations in the stack ADT include: push(), pop(), peek(),
    isFull(), isEmpty(). These are all built-in operations to carry out data manipulation
    and to check the status of the stack.

    Stack uses pointers that always point to the topmost element within the stack,
    hence called as the top pointer.

    Insertion: push()
    push() is an operation that inserts elements into the stack. The following is an
    algorithm that describes the push() operation in a simpler way.

    Algorithm
    1 − Checks if the stack is full.
    2 − If the stack is full, produces an error and exit.
    3 − If the stack is not full, increments top to point next empty space.
    4 − Adds data element to the stack location, where top is pointing.
    5 − Returns success.

    Deletion: pop()
    pop() is a data manipulation operation which removes elements from the stack. The
    following pseudo code describes the pop() operation in a simpler way.

    Algorithm
    1 − Checks if the stack is empty.
    2 − If the stack is empty, produces an error and exit.
    3 − If the stack is not empty, accesses the data element at which top is pointing.
    4 − Decreases the value of top by 1.
    5 − Returns success.

    peek()
    The peek() is an operation retrieves the topmost element within the stack, without
    deleting it. This operation is used to check the status of the stack with the help of
    the top pointer.

    Algorithm
    1. START
    2. return the element at the top of the stack
    3. END

    isFull()
    isFull() operation checks whether the stack is full. This operation is used to check
    the status of the stack with the help of top pointer.

    Algorithm
    1. START
    2. If the size of the stack is equal to the top position of the stack, the stack is full. Return 1.
    3. Otherwise, return 0.
    4. END

    isEmpty()
    The isEmpty() operation verifies whether the stack is empty. This operation is used
    to check the status of the stack with the help of top pointer.

    Algorithm
    1. START
    2. If the top value is -1, the stack is empty. Return 1.
    3. Otherwise, return 0.
    4. END

    You might also like