docs: update links

Author: amejiarosario

README.md

@@ -32,7 +32,9 @@ You can check out the [dsa.js book](https://gum.co/dsajs) that goes deeper into
 
 <a href="https://gum.co/dsajs"><img src="https://user-images.githubusercontent.com/418605/55248546-60ebad80-5220-11e9-8cb5-85923f44e196.png" height="400px" alt="dsajs algorithms javascript book">a>
 
+
 
 ## Data Structures
 
@@ -42,24 +44,30 @@ We are covering the following data structures.
 
 ### Linear Data Structures
 
-1. **Arrays**: Built-in in most languages so not implemented here.
-    [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Array).
+1. **Arrays**: Built-in in most languages so not implemented here. [Array Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/array.adoc#array-complexity)
+    
 
 2. **Linked Lists**: each data node has a link to the next (and
     previous).
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/linked-lists/linked-list.js)
     |
-    [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Linked-Lists).
+    [Linked List Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/linked-list.adoc#linked-list-complexity-vs-array-complexity)
+    
+    .
 
 3. **Queue**: data flows in a "first-in, first-out" (FIFO) manner.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/queues/queue.js)
     |
-    [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Queues)
+    [Queue Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/queue.adoc#queue-complexity)
+    
+    .
 
 4. **Stacks**: data flows in a "last-in, first-out" (LIFO) manner.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/stacks/stack.js)
     |
-    [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Stacks).
+    [Stack Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/stack.adoc#stack-complexity)
+    
+    .
 
 ### Non-Linear Data Structures
 
@@ -68,24 +76,31 @@ We are covering the following data structures.
     graph not a tree.
     [Code](https://github.com/amejiarosario/algorithms.js/tree/master/src/data-structures/trees)
     |
-    [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/)
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree.adoc)
+    
 
     1. **Binary Trees**: same as tree but only can have two children at
         most.
         [Code](https://github.com/amejiarosario/algorithms.js/tree/master/src/data-structures/trees)
         |
-        [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Trees)
+        [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree.adoc#binary-tree)
+        
 
     2. **Binary Search Trees** (BST): same as binary tree, but the
         nodes value keep this order `left < parent < rigth`.
         [Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/binary-search-tree.js)
         |
-        [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Search-Tree-BST)
+        [BST Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--binary-search-tree.adoc#tree-complexity)
+        
 
     3. **AVL Trees**: Self-balanced BST to maximize look up time.
         [Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/avl-tree.js)
         |
-        [Post](https://adrianmejia.com/blog/2018/07/16/self-balanced-binary-search-trees-with-avl-tree-data-structure-for-beginners/)
+        [AVL Tree docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--avl.adoc)
+        |
+        [Self-balancing & tree rotations docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--self-balancing-rotations.adoc)
+        
+        .
 
     4. **Red-Black Trees**: Self-balanced BST more loose than AVL to
         maximize insertion speed.
@@ -96,53 +111,79 @@ We are covering the following data structures.
     1. **Hash Maps**: implements map using a hash function.
         [Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/hash-maps/hashmap.js)
         |
-        [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#HashMaps)
+        [HashMap time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/map-hashmap.adoc#hashmap-time-complexity)
+        
+        
 
     2. **Tree Maps**: implement map using a self-balanced BST.
         [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/maps/tree-maps/tree-map.js)
+        |
+        [TreeMap docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/map-treemap.adoc)
+        |
+        [TreeMap time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/map-hashmap-vs-treemap.adoc#treemap-time-complexity-vs-hashmap)
+        .
 
 3. **Graphs**: data **nodes** that can have a connection or **edge** to
     zero or more adjacent nodes. Unlike trees, nodes can have multiple
     parents, loops.
     [Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/graphs/graph.js)
     |
-    [Post](https://adrianmejia.com/blog/2018/05/14/data-structures-for-beginners-graphs-time-complexity-tutorial/)
+    [Graph Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/graph.adoc#graph-complexity)
+    
 
 ## Algorithms
 
 - Sorting algorithms
 
   - Bubble Sort.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/bubble-sort.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/bubble-sort.adoc)
 
   - Insertion Sort.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/insertion-sort.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/insertion-sort.adoc)
 
   - Selection Sort.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/selection-sort.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/selection-sort.adoc)
 
   - Merge Sort.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/merge-sort.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/merge-sort.adoc)
 
   - Quick sort.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/quick-sort.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/quick-sort.adoc)
 
 - Greedy Algorithms
 
   - Fractional Knapsack Problem.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/knapsack-fractional.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/greedy-algorithms--knapsack-problem.adoc)
 
 - Divide and Conquer
 
   - Fibonacci Numbers.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/fibonacci-recursive.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/divide-and-conquer--fibonacci.adoc)
 
 - Dynamic Programming
 
   - Fibonacci with memoization.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/fibanacci-dynamic-programming.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/dynamic-programming--knapsack-problem.adoc)
 
 - Backtracking algorithms
 
   - Word permutations.
     [Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/permutations-backtracking.js)
+    |
+    [Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/backtracking.adoc)