Question

Write the pseudocode for a non-member method“dequeue” which is utilizing a linked list. The list node has 2 attributes: data and next.  The method would take a “front” and “rear” reference and will return a “character” (the data element from the de-queued node).

**Special note: DO NOT ASSUME THE EXISTENCE OF ANY OTHER METHODS (i.e. don’t use any other methods).  Use basic definitions and standard naming conventions for the stack and queue data structures, figure out the requirements, inputs & outputs (as appropriate), as well as any required error checks.

Answer 1

NOTE : head of the linked list represents FRONT (we remove the element at this end) and tail of the linked list represents REAR (we add the element at this end)

CODE :

// structure of the node

struct Node {

int data;

Ndoe *next

}

int dequee(Node **head) {

if(*head == null)

return -999; // list is empty

int front = (*head)->data;

// forwarding the head pointer

*head = (*head)->next;

return front;

}