Scribd Logo
Upload

Welcome to Scribd!

  • Linked List Questions

    Uploaded by

    Chirag Jain
    4 views4 pages
    In a linked list implementation of a stack, insertion and deletion operations are performed at one end of the list. For a linked list queue, insertion is done at one end while deletion is done at the other end, following the first-in first-out (FIFO) principle. The first node is considered the top of the stack as new elements are always added to the beginning of the linked list for a stack.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    In a linked list implementation of a stack, insertion and deletion operations are performed at one end of the list. For a linked list queue, insertion is done at one end while deletion is done at the other end, following the first-in first-out (FIFO) principle. The first node is considered the top of the stack as new elements are always added to the beginning of the linked list for a stack.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views4 pages

    Linked List Questions

    Uploaded by

    Chirag Jain
    In a linked list implementation of a stack, insertion and deletion operations are performed at one end of the list. For a linked list queue, insertion is done at one end while deletion is done at the other end, following the first-in first-out (FIFO) principle. The first node is considered the top of the stack as new elements are always added to the beginning of the linked list for a stack.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    Linked List Questions

    Note: In Linked List implementation of Stack, Insertion & Deletion operations


    performed at 1 end.
    In Linked List implementation of Queue, Insertion & Deletion operations
    performed at other ends.
    Ans: (d)
    Explanation: Whenever the element is added to the Linked List, it is always
    added at the beginning of the list. Therefore, we can say that the First Node in
    the Linked List is considered as the Top of the Stack.
    Ans: (a)

    Explanation: Since Queue follows FIFO, so new element inserted at last.


    Ans: (c)

    Ans: (b)

    You might also like