Dequeue ADT

Question 1

What is a dequeue?

Answer 1

a double ended queue

Question 2

What is a doubly linked list?

Answer 2

very similar to a singly linked list, but it can be traversed forwards and backwards. This means for each add or remove operation, we need to update the ‘previous’ pointer as well as the ‘next’ pointer

Question 3

What are the main methods for a doubly linked list?

Answer 3

addFirst,
addLast,
removeFirst,
removeLast

Question 4

What are the runtimes for the methods in a doubly lined list

Answer 4

all theta 1

Question 5

What is the dequeue for?

Answer 5

applications that require modification at both ends of the queue, i.e a palindrome checker