Skip to content
#

linkedlist

Here are 23 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

This is a Go program for creating a complete tree using linked list. You can easily insert nodes to the tree and print it. This library provide two inserting functions. One of them is for inserting nodes to the tree by filling the tree from left to right in per row. and the next one is to insert to left side of the tree.

  • Updated Dec 24, 2022
  • Go

Improve this page

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

Learn more