Go data-structure and algorithm implementation this more of a refresher exercise on the basics of theoretical computer science
-
Updated
Jan 26, 2020 - Go
Go data-structure and algorithm implementation this more of a refresher exercise on the basics of theoretical computer science
Implementations of data structures and algorithms in GoLang
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.
Add a description, image, and links to the linkedlists topic page so that developers can more easily learn about it.
To associate your repository with the linkedlists topic, visit your repo's landing page and select "manage topics."