Saved Bookmarks
| 1. |
Write an algorithm to implement deletion operation of queue. |
|
Answer» 1. Start 2. Check for underflow situation by checking the value of Front=-1 (i). If it displays an appropriate message and stops (ii). Otherwise Deleted item=queue [Front] 3. If Front=Rear then Front=Rear=-1 Otherwise Front is incremented by one 4. Print “Item Deleted” 5. Stop |
|