https://github.com/basemax/onewaylinkedlistgo
This is a simple implementation of a one-way linked-list in Go. The one way linkedlist is a data structure that is made up of nodes. Each node contains a value and a pointer to the next node. The head of the list is the first node in the list. The tail of the list is the last node in the list. The tail of the list points to nil.
https://github.com/basemax/onewaylinkedlistgo
go golang link-list linkedlist linkedlist-delete linkedlist-go linkedlist-implementation linkedlist-insert linkedlist-oneway linkedlist-reverse linkedlists linkedlists-using-class one-way-link-list oneway oneway-data-binding oneway-linkedlist
Last synced: 9 months ago
JSON representation
This is a simple implementation of a one-way linked-list in Go. The one way linkedlist is a data structure that is made up of nodes. Each node contains a value and a pointer to the next node. The head of the list is the first node in the list. The tail of the list is the last node in the list. The tail of the list points to nil.
- Host: GitHub
- URL: https://github.com/basemax/onewaylinkedlistgo
- Owner: BaseMax
- License: gpl-3.0
- Created: 2022-11-14T13:11:38.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-12-14T18:22:41.000Z (over 3 years ago)
- Last Synced: 2025-08-11T02:54:34.136Z (9 months ago)
- Topics: go, golang, link-list, linkedlist, linkedlist-delete, linkedlist-go, linkedlist-implementation, linkedlist-insert, linkedlist-oneway, linkedlist-reverse, linkedlists, linkedlists-using-class, one-way-link-list, oneway, oneway-data-binding, oneway-linkedlist
- Language: Go
- Homepage:
- Size: 20.5 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0