From 7e8ee7663eaed82fa0c5c857333e94638453efb6 Mon Sep 17 00:00:00 2001 From: mfurga Date: Mon, 24 Sep 2018 09:39:02 +0200 Subject: [PATCH] Fixed broken link to queue data structure --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index e517987..6ecb4c9 100644 --- a/README.md +++ b/README.md @@ -596,7 +596,7 @@ Write code on a whiteboard or paper, not a computer. Test with some sample input - ### Queue - [ ] [Using Queues First-In First-Out(video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-queues-first-first-out/149042/177122-4.html) - - [ ] [Queue (video)](https://www.coursera.org/learn/data-structures/lecture/EShpq/queue) + - [ ] [Queue (video)](https://www.coursera.org/lecture/data-structures/queues-EShpq) - [ ] [Circular buffer/FIFO](https://en.wikipedia.org/wiki/Circular_buffer) - [ ] [Priority Queues (video)](https://www.lynda.com/Developer-Programming-Foundations-tutorials/Priority-queues-deques/149042/177123-4.html) - [ ] Implement using linked-list, with tail pointer: