Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 3417f7f

Browse files
update broken links
1 parent 31d5deb commit 3417f7f

File tree

6 files changed

+7
-7
lines changed

6 files changed

+7
-7
lines changed

‎book/chapters/map-hashmap.adoc‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -280,7 +280,7 @@ include::{codedir}/data-structures/maps/hash-maps/hash-map.js[tag=rehash, indent
280280
----
281281

282282
In the
283-
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]
283+
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]
284284

285285
== HashMap time complexity
286286

‎book/chapters/map-treemap.adoc‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -36,7 +36,7 @@ For inserting a value on a TreeMap, we first need to inialize the tree:
3636
include::{codedir}/data-structures/maps/tree-maps/tree-map.js[tag=constructor, indent=0]
3737
----
3838

39-
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].
39+
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].
4040

4141
Let's implement the method to add values to the tree.
4242

@@ -84,4 +84,4 @@ include::{codedir}/data-structures/maps/tree-maps/tree-map.js[tag=delete, indent
8484

8585
The BST implementation does all the heavy lifting.
8686

87-
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]
87+
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‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -140,7 +140,7 @@ Array.from(set); //↪️ (4) [1, 2, 3, 5]
140140

141141
No more duplicates in our array!
142142

143-
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].
143+
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].
144144

145145
Let’s now, implement a `HashSet`.
146146

‎book/chapters/stack.adoc‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -47,7 +47,7 @@ Deleting is straightforward as well.
4747
include::{codedir}/data-structures/stacks/stack.js[tag=remove, indent=0]
4848
----
4949

50-
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].
50+
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].
5151

5252
== Implementation Usage
5353

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -148,7 +148,7 @@ Take a look at the code above and the example. You will see how to remove node `
148148
include::{codedir}/data-structures/trees/binary-search-tree.js[tag=leftMost, indent=0]
149149
----
150150

151-
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].
151+
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].
152152

153153
== Differentiating a balanced and non-balanced Tree
154154

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -110,7 +110,7 @@ include::{codedir}/data-structures/trees/binary-tree-node.js[tag=setAndUpdatePar
110110
----
111111

112112
You can also checkout the full
113-
https://github.com/amejiarosario/dsa.js/blob/adfd8a660bbe0a7068fd7881aff9f51bdb9f92ae/src/data-structures/trees/binary-tree-node.js#L20[binary tree node implementation].
113+
https://github.com/amejiarosario/dsa.js/blob/adfd8a660bbe0a7068fd7881aff9f51bdb9f92ae/src/data-structures/trees/binary-tree-node.js#L9[binary tree node implementation].
114114

115115
=== Left Right Rotation
116116

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /