From 6890dd98acf0855d5743522d4d690548fa3bed90 Mon Sep 17 00:00:00 2001 From: Oke Tega Date: Thu, 9 Jan 2020 13:15:08 +0100 Subject: [PATCH] Update readme.md for queues --- 05-chapter-Queue/readme.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/05-chapter-Queue/readme.md b/05-chapter-Queue/readme.md index 7dcb31e..cb59c5b 100644 --- a/05-chapter-Queue/readme.md +++ b/05-chapter-Queue/readme.md @@ -11,7 +11,7 @@ A queue is an example of a first-in, first-out (FIFO) data structure. Queues are ![](https://cdn-images-1.medium.com/max/800/0*SFoM_gyGXk8MIfl4.png) -common operations you can perform on graphs: +common operations you can perform on queues: - `enqueue`: adds a new element to the queue at the last position - `dequeue`: remove the first item from the queue - `front`: returns the first item pushed to queue