queue in data structures....what are the prereqisites you need to know??
It works just like a queue in real life. It will be processed in order of its incoming, e.g. printer queue. I think the opposite would be a stack, where you pick up fro mthe stack the newest addition first.
works like ordinary queue of people os in FIFO fashion(first in first out ) if the queue is empty both headpointer and tailer point to the same cell when it is full the tail poointer is adjust to the head head pointer especialy on that of circular queue
Join our real-time social learning platform and learn together with your friends!