So, what exactly is the difference between LinkedList and Arrays?

The purpose of both of these data structures is to hold a list of items

Properties of a LinkedList

  • No fixed size, No indexes to access elements
  • Every element has a reference (pointer) to the next element
  • Must go through the whole LinkedList to add a new item
4 item LinkedList

Properties of an Array

  • Fixed size and we have indexes
  • Indexes help us pick and choose values from a given position
  • Updating an element is easy → x[2] = 10