Skip to content
#

linkedlist-delete

Here are 10 public repositories matching this topic...

A simple implementation of the Linked list in C/C++. You can build, edit, concatenate two lists, perform union,intersection operation on two lists besides being able to search, sum and move forward a node, combine into two lists into ordered list and delete elements in the list.

  • Updated Jan 23, 2020
  • C++

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 linkedlist-delete 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-delete topic, visit your repo's landing page and select "manage topics."

Learn more