Updated queues - complete.

plan.txt

@@ -218,15 +218,16 @@ Then test it out on a computer to make sure it's not buggy from syntax.
     * - https://class.coursera.org/algs4partI-010/lecture/19
     * - https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html
     * - Will not implement. Implementing with array is trivial.
-Queues
+* - Queues
     * - https://class.coursera.org/algs4partI-010/lecture/20
     * - https://www.coursera.org/learn/data-structures/lecture/EShpq/queue
     * - Circular buffer/FIFO: https://en.wikipedia.org/wiki/Circular_buffer
-    - Implement using linked-list, with tail pointer:
+    * - https://class.coursera.org/algs4partI-010/lecture/23
+    * - Implement using linked-list, with tail pointer:
         - enqueue(value) - adds value at position at tail
         - dequeue() - returns value and removes least recently added element (front)
         - empty()
-    - Implement using fixed-sized array:
+    * - Implement using fixed-sized array:
         - enqueue(value) - adds item at end of available storage
         - dequeue() - returns value and removes least recently added element
         - empty()