Estructura de Datos : Double End Queues ( Dequeue )

Definiciones

Representaciones

     addFirst() --------+                                     +-------- addLast()
                        |                                     |
                        V                                     V
*-------------------------------------------------------------------------------------*
| | | | | | | | | | | | |X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X| | | | | | | | | | | | |
*-------------------------------------------------------------------------------------*
                         |                                   |
                         |                                   |
      getFirst() <-------+                                   +-------> getLast()
                         |                                   |
   removeFirst() <-------+                                   +-------> removeLast()




                <-------+------->                     <-------+------->
                        |                                     |
                        V                                     V
*-------------------------------------------------------------------------------------*
| | | | | | | | | | | | |X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X|X| | | | | | | | | | | | |
*-------------------------------------------------------------------------------------*

Interfases

                                    createDequeue()

                                    addFirst()
                                    getFirst()
                                    removeFirst()

                                    addLast()
                                    getLast()
                                    removeLast()