https://github.com/slingercode/go-linked-list
https://github.com/slingercode/go-linked-list
Last synced: 12 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/slingercode/go-linked-list
- Owner: slingercode
- License: mit
- Created: 2022-05-02T00:04:47.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2022-08-04T15:13:19.000Z (almost 4 years ago)
- Last Synced: 2025-02-23T16:26:27.961Z (over 1 year ago)
- Language: Go
- Size: 1.95 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Linked List
## Build project
`go build -o bin/linked-list`
## Advantages over arrays
1. Dynamic size
2. Ease of insertion/deletion
**Note:**
Let's represent an array of ordered numbers:
`const numbers = [10, 20, 30, 40, 50];`
In this example, in the case of the of a new insertion of a value
like **25**, to mantain the order we need to move all of the elements
after 20 (excluding 20).
Deletion is also expensive, the exemple here is if we remove the value of **10**
we need to move all of the elements after 10.
## Drawbacks
1. Non existing random access, the reason behind this is becouse we need to access
the elements starting from the first node
2. Extra memory, we need to store the value of a pointer
3. Not cache friendly
## Representation
A linked list is representated by a pointer to the first node of the linked list.
The first node is called _Head_. If the linked list is empty then the value of
the head points to `null`.
Each node in a list consists in at least two things:
- Data, the information that we are going to store
- Pointer, the reference to the next node
## References
- [geeksforgeeks - linked lists](https://www.geeksforgeeks.org/data-structures/linked-list)
- [TheAlgorithms](https://github.com/TheAlgorithms/Javascript)