![]() ![]() Step 2: If the queue is empty, then display an underflow message and end the program.Step 1: Check if the queue is empty or not by comparing the number of elements in the queue with 0.Step 3: If the queue is not full, then increment the rear pointer and insert the new element at the position pointed by the rear pointer.Step 2: If the queue is full, then display an overflow message and return. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |