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 2c57521

Browse files
docs(readme): remove weird dots
1 parent 9284acb commit 2c57521

File tree

1 file changed

+0
-5
lines changed

1 file changed

+0
-5
lines changed

‎README.md

Lines changed: 0 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -53,21 +53,18 @@ We are covering the following data structures.
5353
|
5454
[Linked List Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/linked-list.adoc#linked-list-complexity-vs-array-complexity)
5555
<!-- [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Linked-Lists) -->
56-
.
5756

5857
3. **Queue**: data flows in a "first-in, first-out" (FIFO) manner.
5958
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/queues/queue.js)
6059
|
6160
[Queue Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/queue.adoc#queue-complexity)
6261
<!-- [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Queues) -->
63-
.
6462

6563
4. **Stacks**: data flows in a "last-in, first-out" (LIFO) manner.
6664
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/stacks/stack.js)
6765
|
6866
[Stack Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/stack.adoc#stack-complexity)
6967
<!-- [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Stacks) -->
70-
.
7168

7269
### Non-Linear Data Structures
7370

@@ -100,7 +97,6 @@ We are covering the following data structures.
10097
|
10198
[Self-balancing & tree rotations docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--self-balancing-rotations.adoc)
10299
<!-- [Post](https://adrianmejia.com/blog/2018/07/16/self-balanced-binary-search-trees-with-avl-tree-data-structure-for-beginners/) -->
103-
.
104100

105101
4. **Red-Black Trees**: Self-balanced BST more loose than AVL to
106102
maximize insertion speed.
@@ -121,7 +117,6 @@ We are covering the following data structures.
121117
[TreeMap docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/map-treemap.adoc)
122118
|
123119
[TreeMap time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/map-hashmap-vs-treemap.adoc#treemap-time-complexity-vs-hashmap)
124-
.
125120

126121
3. **Graphs**: data **nodes** that can have a connection or **edge** to
127122
zero or more adjacent nodes. Unlike trees, nodes can have multiple

0 commit comments

Comments
(0)

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