Scribd Logo
Upload

Welcome to Scribd!

  • Double Ended Queue Detail

    Uploaded by

    mistefa botani
    5 views1 page
    A double-ended queue (deque) allows efficient insertion and removal at both ends of a list by using a doubly linked list rather than a singly linked list. A deque supports adding and removing elements from either end, as well as accessing the first and last elements, checking if empty, and getting the size. Key deque operations include addFirst, addLast, removeFirst, and removeLast.

    Original Description:

    Original Title

    Double ended queue detail

    Copyright

    © © All Rights Reserved

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A double-ended queue (deque) allows efficient insertion and removal at both ends of a list by using a doubly linked list rather than a singly linked list. A deque supports adding and removing elements from either end, as well as accessing the first and last elements, checking if empty, and getting the size. Key deque operations include addFirst, addLast, removeFirst, and removeLast.

    Copyright:

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

    Double Ended Queue Detail

    Uploaded by

    mistefa botani
    A double-ended queue (deque) allows efficient insertion and removal at both ends of a list by using a doubly linked list rather than a singly linked list. A deque supports adding and removing elements from either end, as well as accessing the first and last elements, checking if empty, and getting the size. Key deque operations include addFirst, addLast, removeFirst, and removeLast.

    Copyright:

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

    Preparing by designer

    Chewan jalal group (c)


    Adl mohamad
    Sabr abdulla

    Double ended queue:_


    Since the deque requires insertion and removal at both ends of a list, using a singly
    linked list to implement a deque would be inefficient. Wlist, however, to implement a deque
    efficiently.
    Double ended queue can do support these following
    function::::::::::::

    addFirst(e): Insert a new element e at the beginning of the deque.


    addLast(e): Insert a new element e at the end of the deque.
    removeFirst(): Remove and return the first element of the deque; an
    error occurs if the deque is empty.
    removeLast(): Remove and return the last element of the deque; an
    error occurs if the deque is empty.
    Additionally, the deque ADT may also include the following support methods:
    getFirst(): Return the first element of the deque; an error occurs if
    the deque is empty.
    getLast(): Return the last element of the deque; an error occurs if the
    deque is empty.
    size(): Return the number of elements of the deque.
    isEmpty(): Determine if the deque is empty.
    The deque abstract data type is richer than both the stack and the queue ADTs. The
    fundamental methods of the deque ADT are as follows:
    addFirst(e): Insert a new element e at the beginning of the deque.
    addLast(e): Insert a new element e at the end of the deque.
    removeFirst(): Remove and return the first element of the deque; an
    error occurs if the deque is empty.
    removeLast(): Remove and return the last element of the deque; an
    error occurs if the deque is empty.
    Additionally, the deque ADT may also include the following support methods:
    getFirst(): Return the first element of the deque; an error occurs if
    the deque is empty.
    getLast(): Return the last element of the deque; an error occurs if the
    deque is empty.
    size(): Return the number of elements of the deque.
    isEmpty(): Determine if the deque is empty.

    You might also like