PROCEDURE PUSH_QUEUE(TOP)
[Where the starting pointer head has been caught in pointer ‘TOP’]

1. [Traversing to end of queue]

while (LINK(TOP) !=0)
TOP <-- LINK (TOP).

2. [Allocating the memory for new node & pushing it into queue]

Call GETNODE (P)
DATA (P) <-- ‘xyz’
LINK (TOP) <-- P.

3. [FINISH]
return.