Movatterモバイル変換

Skip to content

lineCode/javascript-algorithmsPublic

forked fromtrekhleb/javascript-algorithms

NotificationsYou must be signed in to change notification settings
Fork0
Star0

Commitef72e2d

trekhleb

committed

Update READMEs.

1 parenta41e4a1 commitef72e2dCopy full SHA for ef72e2d

File tree

9 files changed

+17

-11

lines changed

src/data-structures
- disjoint-set
  - README.md
- hash-table
  - README.md
- heap
  - README.md
- linked-list
  - README.md
- priority-queue
  - README.md
- queue
  - README.md
- stack
  - README.md
- tree
  - README.md
- trie
  - README.md

9 files changed

+17

-11

lines changed

`‎src/data-structures/disjoint-set/README.md`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -17,4 +17,4 @@ After some operations of Union, some sets are grouped together.`
`17`	`17`	`##References`
`18`	`18`
`19`	`19`	`-[Wikipedia](https://en.wikipedia.org/wiki/Disjoint-set_data_structure)`
`20`		`--[By Abdul Bari on YouTube](https://www.youtube.com/watch?v=wU6udHRIkcc)`
	`20`	`+-[By Abdul Bari on YouTube](https://www.youtube.com/watch?v=wU6udHRIkcc&index=14&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)`

`‎src/data-structures/hash-table/README.md`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -22,4 +22,5 @@ Hash collision resolved by separate chaining.`
`22`	`22`
`23`	`23`	`##References`
`24`	`24`
`25`		`-[Wikipedia](https://en.wikipedia.org/wiki/Hash_table)`
	`25`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Hash_table)`
	`26`	`+-[YouTube](https://www.youtube.com/watch?v=shs0KM3wKv8&index=4&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)`

`‎src/data-structures/heap/README.md`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -12,4 +12,5 @@ called the root node.`
`12`	`12`
`13`	`13`	`##References`
`14`	`14`
`15`		`-[Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))`
	`15`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Heap_(data_structure))`
	`16`	`+-[YouTube](https://www.youtube.com/watch?v=t0Cq6tVNRBA&index=5&t=0s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)`

`‎src/data-structures/linked-list/README.md`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -21,4 +21,5 @@ have better cache locality as compared to linked lists.`
`21`	`21`
`22`	`22`	`##References`
`23`	`23`
`24`		`-[Wikipedia](https://en.wikipedia.org/wiki/Linked_list)`
	`24`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Linked_list)`
	`25`	`+-[YouTube](https://www.youtube.com/watch?v=njTh_OwMljA&index=2&t=1s&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)`

`‎src/data-structures/priority-queue/README.md`

Lines changed: 2 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -14,8 +14,7 @@ with a linked list or an array, a priority queue can be implemented`
`14`	`14`	`with a heap or a variety of other methods such as an unordered`
`15`	`15`	`array.`
`16`	`16`
`17`		`-`
`18`		`-`
`19`	`17`	`##References`
`20`	`18`
`21`		`-[Wikipedia](https://en.wikipedia.org/wiki/Priority_queue)`
	`19`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Priority_queue)`
	`20`	`+-[YouTube](https://www.youtube.com/watch?v=wptevk0bshY&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=6)`

`‎src/data-structures/queue/README.md`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -22,4 +22,5 @@ Representation of a FIFO (first in, first out) queue`
`22`	`22`
`23`	`23`	`##References`
`24`	`24`
`25`		`-[Wikipedia](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))`
	`25`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Queue_(abstract_data_type))`
	`26`	`+-[YouTube](https://www.youtube.com/watch?v=wjI1WNcIntg&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=3&)`

`‎src/data-structures/stack/README.md`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -21,4 +21,5 @@ Simple representation of a stack runtime with push and pop operations.`
`21`	`21`
`22`	`22`	`##References`
`23`	`23`
`24`		`-[Wikipedia](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))`
	`24`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Stack_(abstract_data_type))`
	`25`	`+-[YouTube](https://www.youtube.com/watch?v=wjI1WNcIntg&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=3&)`

`‎src/data-structures/tree/README.md`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -24,4 +24,5 @@ root node, at the top, has no parent.`
`24`	`24`
`25`	`25`	`##References`
`26`	`26`
`27`		`-[Wikipedia](https://en.wikipedia.org/wiki/Tree_(data_structure))`
	`27`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Tree_(data_structure))`
	`28`	`+-[YouTube](https://www.youtube.com/watch?v=oSWTXtMglKE&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=8)`

`‎src/data-structures/trie/README.md`

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -19,4 +19,5 @@ prefix tree.`
`19`	`19`
`20`	`20`	`##References`
`21`	`21`
`22`		`-[Wikipedia](https://en.wikipedia.org/wiki/Trie)`
	`22`	`+-[Wikipedia](https://en.wikipedia.org/wiki/Trie)`
	`23`	`+-[YouTube](https://www.youtube.com/watch?v=zIjfhVPRZCg&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8&index=7&t=0s)`

0 commit comments

Comments

(0)

[8]ページ先頭

©2009-2025 Movatter.jp