Skip to content
#

link-list

Here are 2 public repositories matching this topic...

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.

  • Updated Dec 14, 2022
  • Go

Improve this page

Add a description, image, and links to the link-list 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 link-list topic, visit your repo's landing page and select "manage topics."

Learn more