| 71 | } |
| 72 | |
| 73 | T dequeue() { |
| 74 | // Return 0 if queue is empty |
| 75 | if(isEmpty()) |
| 76 | return 0; |
| 77 | T ans=fron->data; |
| 78 | Node<T>*temp=fron->next; |
| 79 | fron->next=NULL; |
| 80 | fron=temp; |
| 81 | size--; |
| 82 | return ans; |
| 83 | } |
| 84 | |
| 85 | T front() { |
| 86 | // Return 0 if queue is empty |