Unlike stacks, a queue is open at both its ends. One end is always used to insert data (enqueue) and the other is used to remove data (dequeue). Queue follows First-In-First-Out methodology, i.e., the data item stored first will be accessed .
cdedmondson / enqueue-dequeue Goto Github PK
View Code? Open in Web Editor NEWDemonstration of a queue data structure