==>  Queue--

•  Queue is a first in first out FIFO linear data structure Queue is an important data structure for computer applications even.
• Queue is linear data structure in which deletion of element can take place only at one end called the front end and insertion can take place at the other end called the rear

==> Basic features of Queue--

1. Like Stack, Queue is also an ordered list of elements of similar data types.
2. Queue is a FIFO( First in First Out ) structure.
3. Once a new element is inserted into the Queue, all the elements inserted before the new element in the queue must be removed, to remove the new element.
4. peek( ) function is oftenly used to return the value of first element without dequeuing it.

==> Tower of Hanoi--

• Tower of Hanoi, is a mathematical puzzle which consists of three tower (pegs) and more than one rings
• These rings are of different sizes and stacked upon in ascending order i.e. the smaller one sits over the larger one. There are other variations of puzzle where the number of disks increase, but the tower count remains the same.