update broken links

Author: amejiarosario

book/chapters/map-hashmap.adoc

@@ -280,7 +280,7 @@ include::{codedir}/data-structures/maps/hash-maps/hash-map.js[tag=rehash, indent
 ----
 
 In the
-https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/maps/hash-maps/primes.js[prime.js] file you can find the implementation for finding the next prime. Also, you can see the full HashMap implementation on this file: https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/maps/hash-maps/hash-map.js#L1[hashmap.js]
+https://github.com/amejiarosario/dsa.js/blob/7694c20d13f6c53457ee24fbdfd3c0ac57139ff4/src/data-structures/maps/hash-maps/primes.js#L33[prime.js] file you can find the implementation for finding the next prime. Also, you can see the full HashMap implementation on this file: https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/maps/hash-maps/hash-map.js#L1[hashmap.js]
 
 == HashMap time complexity
 

book/chapters/map-treemap.adoc

@@ -36,7 +36,7 @@ For inserting a value on a TreeMap, we first need to inialize the tree:
 include::{codedir}/data-structures/maps/tree-maps/tree-map.js[tag=constructor, indent=0]
 ----
 
-The tree can be an instance of any Binary Search Tree that we implemented so far. However, for better performance, it should be a self-balanced tree like a https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/trees/red-black-tree.js[Red-Black Tree] or https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/trees/avl-tree.js[AVL Tree].
+The tree can be an instance of any Binary Search Tree that we implemented so far. However, for better performance, it should be a self-balanced tree like a https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/trees/red-black-tree.js#L20[Red-Black Tree] or https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/trees/avl-tree.js#L64[AVL Tree].
 
 Let's implement the method to add values to the tree.
 
@@ -84,4 +84,4 @@ include::{codedir}/data-structures/maps/tree-maps/tree-map.js[tag=delete, indent
 
 The BST implementation does all the heavy lifting.
 
-That’s it! To see the full file in context, click here: https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/maps/tree-maps/tree-map.js[here]
+That’s it! To see the full file in context, click here: https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/maps/tree-maps/tree-map.js#L22[here]

book/chapters/set.adoc

@@ -140,7 +140,7 @@ Array.from(set); //↪️ (4) [1, 2, 3, 5]
 
 No more duplicates in our array!
 
-Check out our https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/sets/tree-set.js[GitHub repo for the full TreeSet implementation].
+Check out our https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/sets/tree-set.js#L12[GitHub repo for the full TreeSet implementation].
 
 Let’s now, implement a `HashSet`.
 

book/chapters/stack.adoc

@@ -47,7 +47,7 @@ Deleting is straightforward as well.
 include::{codedir}/data-structures/stacks/stack.js[tag=remove, indent=0]
 ----
 
-This time we used the linked list’s `removeLast` method. That’s all we need for a stack implementation. Check out the full implementation https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/stacks/stack.js[here].
+This time we used the linked list’s `removeLast` method. That’s all we need for a stack implementation. Check out the full implementation https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/stacks/stack.js#L6[here].
 
 == Implementation Usage
 

book/chapters/tree--binary-search-tree.adoc

@@ -148,7 +148,7 @@ Take a look at the code above and the example. You will see how to remove node `
 include::{codedir}/data-structures/trees/binary-search-tree.js[tag=leftMost, indent=0]
 ----
 
-That’s all we need to remove elements from a BST. Check out the complete BST implementation https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/trees/binary-search-tree.js[here].
+That’s all we need to remove elements from a BST. Check out the complete BST implementation https://github.com/amejiarosario/dsa.js/blob/f69b744a1bddd3d99243ca64b3ad46f3f2dd7342/src/data-structures/trees/binary-search-tree.js#L5[here].
 
 == Differentiating a balanced and non-balanced Tree
 

book/chapters/tree--self-balancing-rotations.adoc

@@ -110,7 +110,7 @@ include::{codedir}/data-structures/trees/binary-tree-node.js[tag=setAndUpdatePar
 ----
 
 You can also checkout the full
-https://github.com/amejiarosario/dsa.js/blob/adfd8a660bbe0a7068fd7881aff9f51bdb9f92ae/src/data-structures/trees/binary-tree-node.js#L20[binary tree node implementation].
+https://github.com/amejiarosario/dsa.js/blob/adfd8a660bbe0a7068fd7881aff9f51bdb9f92ae/src/data-structures/trees/binary-tree-node.js#L9[binary tree node implementation].
 
 === Left Right Rotation