Computer Science, asked by mayuri5659, 1 year ago

Write an algorithm for creation of a circular queue and deletion of an element from a circular queue.

Answers

Answered by Ritiksuglan
4

Answer:

ANSWAR:-

The queue is considered as a circular queue when the positions 0 and MAX-1 are adjacent. Any position before front is also after rear.

MAY BE IT'S HELPFUL FOR YOU

PLEASE MARK ME AS BRAINLIEST ✌️✌️

Attachments:
Similar questions