Fixed broken link

Author: webtaculars

README.md

@@ -14,7 +14,7 @@
 | 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.- | [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.
-| 9.- | [Binary Trees and Binary Search Trees](./10-chapter-Binary-Trees.js) | 4 | `Binary trees` are chosen over other more primary data structures because you can search a binary tree very quickly (as opposed to a linked list, for example) and you can quickly insert and delete data from a binary tree (as opposed to an array).
+| 9.- | [Binary Trees and Binary Search Trees](./10-chapter-Binary-Tree) | 4 | `Binary trees` are chosen over other more primary data structures because you can search a binary tree very quickly (as opposed to a linked list, for example) and you can quickly insert and delete data from a binary tree (as opposed to an array).
 | 10.- | [Graph Data Structure](./11-chapter-Graphs) | 2 | A graph consists of a set of vertices and a set of edges. A map is a type of graph where each town is a vertex, and a road that connects two towns is an edge. Edges are defined as a pair (v1, v2), where v1 and v2 are two vertices in a graph
 | 11.- | [Sorting Algorithms](./12-chapter-Sorting-Algorithms) | 6 | Two of the most common operations performed on data stored in a computer are sorting and searching.
 | 12.- | [Searching Algorithms](./13-chapter-Searching-Algorithms) | 6 | There are two ways to search for data in a list: sequential search and binary search. A sequential search is used when the items in a list are in random order; a binary search is used when the items in a list are in sorted order.