Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add README for queue #66

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 14 additions & 0 deletions queue/README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
# Queue

## Introduction
A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. The difference between stacks and queues is in removing. In a stack we remove the item the most recently added; in a queue, we remove the item the least recently added.

![Queue](https://upload.wikimedia.org/wikipedia/commons/5/52/Data_Queue.svg)


## List of Programs
- ### [Queue using Array](Queue.java)
The program [Queue.java](Queue.java) contains the implementation of the using Array data structure. The program [QueueHelper.java](QueueHelper.java) utilizes the datastructure and let you push and pop elements in the Queue, also giving you the functionality to print the queue.

- ### [Queue using Linked List](QueueLinkedList.java)
The Program [QueueLinkedList.java](QueueLinkedList.java) contains the implementation for Queue using Linked List data structure. The program [QueueImplementer.java](QueueImplementer.java) utilizes the datastructure and let you push and pop elements in the Queue, also giving you the functionality to print the queue.