Read About Queue Data Structure In C In Brief.
![qa-featured](https://www.techyv.com/sites/default/users/superadmin/qa-featured-300x270.png)
Hello,
I am willing to learn C language with accuracy and precision. But I am stuck at the concept of Queue Data Structure in C. Can someone explain about it in C language?
Please reply ASAP.
![](https://techyv.com/sites/default/2016/10/techpedia_logo.png)
Hello,
I am willing to learn C language with accuracy and precision. But I am stuck at the concept of Queue Data Structure in C. Can someone explain about it in C language?
Please reply ASAP.
A queue works on the concept of FIFO which stands for First-In-First-Out, which means that the first entered item will remove first. The queue has two ends front and rear, from the front end, you can insert element, and from the other end, you can delete one.
A real-life example of a queue is a movie ticket counter, the first person who stands in front of the ticket window takes first and remove from that line, and a new person always stand in the line from the end.