Challenge 09 - 🔗 Singly Linked Lists
👋 Welcome Gophers! In this challenge, you will be implementing some of the basic functionality of a singly linked-list in Go! 💪
In this challenge, we will be attempted to implement the
Add function of a singly linked list.
Linked lists are a data structure we can utilize in order to represent a sequence of elements or
nodes as they are called. Singly linked lists are a one way sequence where each
node contains a pointer to the next
node in the list.
Doubly linked lists on the other hand have 2 pointers to both the previous
node and the next
node and can be traversed back and forth.
In this challenge, you will be implementing a very simple, singly linked list that allows you to append new
string values to the end of our linked list and ensure that you update the
Head values appropriately.
If you enjoyed this challenge, then feel free to try some of the other challenges on the site: