Scribd Logo
Upload

Welcome to Scribd!

  • Queue Insertion at Rear or Back

    Uploaded by

    Christina Robinson
    18 views1 page
    In a queue, insertion is done at the rear of the queue, with the first element inserted being the first element removed. Elements are removed from the front of the queue on a first-in, first-out basis. New elements can only be added at the rear of the queue, not in the middle or front.

    Original Description:

    good thing tp

    Original Title

    kavithads2

    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
    In a queue, insertion is done at the rear of the queue, with the first element inserted being the first element removed. Elements are removed from the front of the queue on a first-in, first-out basis. New elements can only be added at the rear of the queue, not in the middle or front.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    18 views1 page

    Queue Insertion at Rear or Back

    Uploaded by

    Christina Robinson
    In a queue, insertion is done at the rear of the queue, with the first element inserted being the first element removed. Elements are removed from the front of the queue on a first-in, first-out basis. New elements can only be added at the rear of the queue, not in the middle or front.

    Copyright:

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

    12) In a queue, insertion is done at

    (a) Rear

    (b) Front

    (c) Back

    (d) Top

    You might also like