Java Collections Queue, Deque Und Stack

Front 1

Queue:

Insert Element

Throws Exception if Operation fails

Back 1

add(e)

Equivalent Deque Method: addLast()

Front 2

Queue:

Insert Element

Returns special value if Operation fails

Back 2

offer(e)

Equivalent Deque Method: offerLast()

Front 3

Queue:

Remove Element

Throws Exception if Operation fails

Back 3

remove()

Equivalent Deque Method: removeFirst()

Front 4

Queue:

Examine Element (without removing it)

Throws Exception if Operation fails

Back 4

element()

Equivalent Deque Method: getFirst()

Front 5

Queue:

Examine Element (without removing it)

Returns special value if Operation fails

Back 5

peek()

Equivalent Deque Method: peekFirst()

Front 6

Queue:

Remove Element

Throws Exception if Operation fails

Back 6

poll()

Equivalent Deque Method: pollFirst()

Front 7

Deque:

Insert last Element (at tail)

Throws Exception if Operation fails

Back 7

addLast(e)

Front 8

Deque:

Insert last Element (at tail)

Returns special value if Operation fails

Back 8

offerLast(e)

Front 9

Deque:

Remove last Element (from tail)

Returns special value if Operation fails

Back 9

pollLast()

Front 10

Deque:

Remove last Element (from tail)

Throws Exception if Operation fails

Back 10

removeLast()

Front 11

Deque:

Examine last Element (at tail)

Throws Exception if Operation fails

Back 11

getLast()

Front 12

Deque:

Examine last Element (at tail)

Returns special value if Operation fails

Back 12

peekLast()

Front 13

Deque:

Insert first Element (at head)

Throws Exception if Operation fails

Back 13

addFirst()

Front 14

Deque:

Insert first Element (at head)

Returns special value if Operation fails

Back 14

offerFirst()

Front 15

Deque:

Remove first Element (at head)

Returns special value if Operation fails

Back 15

pollFirst()

Front 16

Deque:

Remove first Element (at head)

Throws Exception if Operation fails

Back 16

removeFirst()

Front 17

Deque:

Examine first Element (at head)

Throws Exception if Operation fails

Back 17

getFirst()

Front 18

Deque:

Examine first Element (at head)

Returns special value if Operation fails

Back 18

peekFirst()

Front 19

Stack:

Insert Element (on top of Stack)

Back 19

push(e)

Equivalent Deque Method: addFirst()

Front 20

Stack:

Remove Element (from top of Stack)

(Throws EmptyStackException - if this stack is empty.)

Back 20

pop()

Equivalent Deque Method: removeFirst()

Front 21

Stack:

Examine Element (on top of Stack)

(Throws EmptyStackException - if this stack is empty.)

Back 21

peek()

Equivalent Deque Method: peekFirst()

Front 22

What is the Equivalent Deque Method for the Queue Method add(e)?

Back 22

addLast(e)

Front 23

What is the Equivalent Deque Method for the Queue Method offer(e)?

Back 23

offerLast(e)

Front 24

What is the Equivalent Deque Method for the Queue Method remove()?

Back 24

removeFirst()

Front 25

What is the Equivalent Deque Method for the Queue Method poll()?

Back 25

pollFirst()

Front 26

What is the Equivalent Deque Method for the Queue Method element()?

Back 26

getFirst()

Front 27

What is the Equivalent Deque Method for the Queue Method peek()?

Back 27

peekFirst()

Front 28

What is the Equivalent Queue Method for the Deque Method addLast(e)?

Back 28

add(e)

Front 29

What is the Equivalent Queue Method for the Deque Method offerLast(e)?

Back 29

offer(e)

Front 30

What is the Equivalent Queue Method for the Deque Method removeFirst()?

Back 30

remove()

Front 31

What is the Equivalent Queue Method for the Deque Method pollFirst()?

Back 31

poll()

Front 32

What is the Equivalent Queue Method for the Deque Method getFirst()?

Back 32

element()

Front 33

What is the Equivalent Queue Method for the Deque Method peekFirst()?

Back 33

peek()

Front 34

What is the Equivalent Deque Method for the Stack Method push(e)?

Back 34

addFirst(e)

Front 35

What is the Equivalent Deque Method for the Stack Method pop()?

Back 35

removeFirst()

Front 36

What is the Equivalent Deque Method for the Stack Method peek()?

Back 36

peekFirst()

Front 37

What is the Equivalent Stack Method for the Deque Method addFirst(e)?

Back 37

push(e)

Front 38

What is the Equivalent Stack Method for the Deque Method removeFirst()?

Back 38

pop()

Front 39

What is the Equivalent Stack Method for the Deque Method peekFirst()?

Back 39

peek()