Answer:PROCEDURE CREATE_QUEUE(TOP)
[Where ‘head’ pointer has been caught in pointer ‘TOP’ and function is void]
1. [Allocating memory for new node & having the value from user]
Call GETNODE (TOP)
DATA (TOP) <-- ‘xyz’
LINK (TOP) <-- 0.
2. [Checking the value of last node & calling the function recursiverly]
if(DATA (TOP) <= 0)
return
else
Call CREATE_QUEUE (LINK(TOP))
3. [FINISH]
return.