https://github.com/neuodev/doubly-linked-list
In this project; I implement a Doubly linked list using JavaScript that has the methods: remove(idx), insert(idx, val), set(idx, val), get(idx), unshift(val), shift(), pop(), push(val)
https://github.com/neuodev/doubly-linked-list
Last synced: 2 months ago
JSON representation
In this project; I implement a Doubly linked list using JavaScript that has the methods: remove(idx), insert(idx, val), set(idx, val), get(idx), unshift(val), shift(), pop(), push(val)
- Host: GitHub
- URL: https://github.com/neuodev/doubly-linked-list
- Owner: neuodev
- Created: 2021-03-28T08:02:08.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2023-05-05T20:49:53.000Z (about 3 years ago)
- Last Synced: 2026-03-31T05:39:15.641Z (4 months ago)
- Language: JavaScript
- Homepage:
- Size: 118 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Doubly Linked List
In this project I implement Doubly linked list using JavaScript
Methods: `remove(idx), insert(idx, val), set(idx, val), get(idx), unshift(val), shift(), pop(), push(val)`
- `remove(idx)` $\to$ remove node at given idx
- `insert(idx ,val)` $\to$ insert new node at idx
- `set(idx , val)` $\to$ change the value of a node at given idx
- `get(idx)` $\to$ traverse the list to reach the node and return it
- `ushift(val)` $\to$ add value to the start of the linked list
- `shift()` $\to$ remove value from the end of the linked list
- `pop()` $\to$ remove value form the end of the linked list
- `push(val)` $\to$ add new value to the end of the linked list

