fixing readme

Author: crizstian

06-chapter-Linked-Lists-types/readme.md

@@ -2,7 +2,7 @@
 
 ### Code Examples
 
-- [Single, Double, Circular, Linked List, Data Structure]('./linked.proto.module')
+- [Single, Double, Circular, Linked List, Data Structure]('./linked.proto.module.js')
 - [Import complete module]('./index')
 
 ### Definition Linked List

README.md

@@ -10,9 +10,9 @@
 | 2.- | [Lists](./03-chapter-List.js) | 5 | A `List` is an ordered sequence of data, where elements are not meant to be ordered.
 | 3.- | [Stacks](./04-chapter-Stack) | 3 | A `Stack` is an example of Last-in, First-Out (LIFO)
 | 4.- | [Queues](./05-chapter-Queue) | 2 | A `Queue` is an example of First-in, First-Out (FIFO)
-| 5.- | [Linked List](./06-chapter-1-Linked-List.js) | 4 | A `Linked list` is a collection of objects called nodes. Each node is linked to a successor node in the list using an object reference.
-| 6.- | [Double Linked List](./06-chapter-2-Double-Linked-List.js) | 4 | Traversing a `Double linked list` are more efficient, since we no longer have to search for the previous node.
-| 7.- | [Circular Linked List](./06-chapter-3-Circular-Linked-List.js) | 4 | The reason you might want to create a `Circular linked list` is if you want the ability to go backward through a list but don’t want the extra overhead of creating a doubly linked list.
+| 5.- | [Linked List](./06-chapter-Linked-Lists-types) | 4 | A `Linked list` is a collection of objects called nodes. Each node is linked to a successor node in the list using an object reference.
+| 6.- | [Double Linked List](./06-chapter-Linked-Lists-types) | 3 | Traversing a `Double linked list` are more efficient, since we no longer have to search for the previous node.
+| 7.- | [Circular Linked List](./06-chapter-Linked-Lists-types) | 4 | The reason you might want to create a `Circular linked list` is if you want the ability to go backward through a list but don’t want the extra overhead of creating a doubly linked list.
 | 8.- | [Dictionaries](./07-chapter-Dictionaries.js) | 3 | A `Dictionary` is a data structure that stores data as key-value pairs.
 | 9.- | [Hashing](./08-chapter-Hashing.js) | 2 | `Hashing` is a common technique for storing data in such a way that the data can be inserted and retrieved very quickly. Hashing uses a data structure called a hash table. Although hash tables provide fast insertion, deletion, and retrieval, they perform poorly for operations that involve searching.
 | 10.- | [Set](./09-chapter-Set.js) | 4 | A `Set` is a collection of unique elements. The elements of a set are called members. The two most important properties of sets are that the members of a set are unordered and that no member can occur in a set more than once.