Skip to content
#

linkedlist-implementation

Star

Here is 1 public repository matching this topic...

Language: Go
Filter by language
All 8 C++ 3 Java 2 C# 1 Go 1 Python 1

BaseMax / OneWayLinkedListGo

Sponsor
Star 0

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

Improve this page

Add a description, image, and links to the linkedlist-implementation topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the linkedlist-implementation topic, visit your repo's landing page and select "manage topics."

Learn more