Queue is a First-In-First-Out (FIFO) data structure. In Queue the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed. Adding element in Queue is called EnQueue and removing element is called DeQueue. Often a peek or front operation is also entered, returning the value of the front element without dequeuing it. In this video we will see : - What is Queue - EnQueue - DeQueue - Insert - Remove - Size - isEmpty - What is Front - What is Rear -