Linked List Basics

A linked list is a data structure made up of multiple elements where each element contains a pointer to the next element in the list in a daisy chain fashion. Some advantage of a linked list include the ability to easily and efficiently insert and remove elements from the list as well as not needing to define an initial size as they can grow and shrink during run-time. They do however lack efficiency when attempting to access a specific element in the list, due to their linear nature. The only way to access a specific element in the list is to iterate sequentially from the first element until the desired element.