5
Reply

Difference between stack and queue?

Akshay Amin

Akshay Amin
Jul 21
1.4k
1
Reply
    Pankajkumar Patel

    Key difference between Stack and Queue is how elements are added and removed.

    Stack

    1. Order: Last In, First Out (LIFO)
    2. Operations:
      1. Push: Add an element to the top
      2. Pop: Remove the top element
    3. Use Case: Undo functionality in software, where the last action is undone first.
    4. Example:
      1. Stack (Top → Bottom):
      2. [5]
      3. [3]
      4. [1] ← First inserted
      5. Pop removes 5, the last inserted.

    Queue

    1. Order: First In, First Out (FIFO)
    2. Operations:
      1. Enqueue: Add an element to the end
      2. Dequeue: Remove the front element
    3. Use Case: Print queue, where the first document sent is printed first.
    4. Example:
      1. Queue (Front → Rear):
      2. [1] ← First inserted
      3. [3]
      4. [5]
      5. Dequeue removes 1, the first inserted.
    Pankajkumar Patel
    Sep 18
    1
    Gaurav Kumar
    STACK A stack is a linear data structure that follows the LIFO (Last In, First Out) principle. This means the element inserted last will be removed first. Key Features: Elements are added and removed from the same end (called TOP).Works like a stack of plates — the last plate kept is the first to be taken out.Operations:Push: Insert an element into the stack.Pop: Remove the top element from the stack.Peek/Top: View the top element without removing it.Example: Imagine a pile of books 📚.You keep placing books on top (push).To take one, you remove the topmost book first (pop).Applications of Stack:Undo/Redo functionality in editorsBrowser history (back and forward buttons)Expression evaluation in programmingRecursive function callsQUEUE Definition: A queue is a linear data structure that follows the FIFO (First In, First Out) principle. This means the element inserted first will be removed first.Key Features:Elements are added at the rear (enqueue) and removed from the front (dequeue).Works like a bus queue — the first person in line gets in the bus first.Operations:Enqueue: Insert an element at the rear.Dequeue: Remove an element from the front.Peek/Front: View the front element without removing it.Example: A ticket counterThe person who comes first gets the ticket first.
    Gaurav Kumar
    Aug 26
    1
    Sujeet Kumar sahu 
    A Stack follows LIFO (Last In First Out), where the last inserted element is removed first. A Queue follows FIFO (First In First Out), where the first inserted element is removed first. Stack operations are Push and Pop, while Queue operations are Enqueue and Dequeue.

    Sujeet Kumar sahu
    Jun 10
    0
    Sujeet Kumar sahu 
    A Stack follows LIFO (Last In First Out), where the last inserted element is removed first. A Queue follows FIFO (First In First Out), where the first inserted element is removed first. Stack operations are Push and Pop, while Queue operations are Enqueue and Dequeue.

    Sujeet Kumar sahu
    Jun 10
    0
    Priya Prajapati

    Stack : Stack is works on Last in First out (LIFO) principle . Means elements are add and remove only one way .

    Queue : Queue is works on First out First out (FIFO) principle . Which means elements are add first into queue is also remove first .

    Priya Prajapati
    Jan 10
    0
Message