proxy.golang.org : 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.
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/basemax/%21one%21way%21linked%21list%21go
Keywords:
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
License: GPL-3.0
Latest release: about 1 month ago
Namespace: github.com/basemax
Stars: 0 on GitHub
Forks: 0 on GitHub
See more repository details: repos.ecosyste.ms
Last synced: about 1 month ago