Built with from Grav and Hugo
Linked Lists behave much like arrays on the surface, but allow for a dynamic quantity of elements.
This dynamic behavior comes at a cost: complexity.