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.
go
golang
linkedlist
oneway
linkedlists
linkedlists-using-class
link-list
linkedlist-insert
linkedlist-delete
linkedlist-reverse
oneway-data-binding
linkedlist-implementation
linkedlist-go
oneway-linkedlist
linkedlist-oneway
one-way-link-list
-
Updated
Dec 14, 2022 - Go