Question

Problem 6: [20%] Using a singly linked list with two references (firstNode and lastNode) to implement Queue's deletion method, i.e. dequeue() firstNode Entry at front of queue Answer: // delete first node from a linked list and return its data // firstNode and lastNode may be accessed directly public T dequeue() { lastNode Entry at back of queue

          Problem 6: [20%] Using a singly linked list with two references (firstNode and lastNode) to
implement Queue's deletion method, i.e. dequeue()
firstNode
Entry at front
of queue
Answer:
// delete first node from a linked list and return its data
// firstNode and lastNode may be accessed directly
public T dequeue()
{
lastNode
Entry at back
of queue

Problem 6: [20%] Using a singly linked list with two references (firstNode and lastNode) to
implement Queue's deletion method, i.e. dequeue()
firstNode
Entry at front
of queue
Answer:
// delete first node from a linked list and return its data
// firstNode and lastNode may be accessed directly
public T dequeue()

lastNode
Entry at back
of queue

Added by Chelsea P.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Pritesh Ranjan

Step 1

Check if the queue is empty. If the firstNode is null, then the queue is empty and there is nothing to dequeue. In this case, you can throw an exception or return null to indicate that the queue is empty. Show more…

Show all steps

Thanks for your feedback!

Implement Queue's deletion method, i.e. dequeue. Answer: Delete the first node from a linked list and return its data. The firstNode and lastNode may be accessed directly. public T dequeue()