InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
Insert(Q,k) {createNode(k);new->next = 0;Q->next new;}new =2-31Ο ΝοNextQ;delete(Q){if(Q==null){print("Empty Queue");return;}tempwhile(temp->next!=null){prev=temp;temp=temp->next;}prev->next = null;return temp->data;} |
| Answer» REVERSE the ELEMENTS 3-2-1-NULL | |