What are Linked Lists

• Consist of a group of nodes linked in a sequence.
• Unlike arrays, they can dynamically shrink and grow.
• Each node contains two pieces of data: value and the address of the next node.

Time Complexity

• Lookup
  • by Value: O(n)
  • by Index: O(n)
• Insert
  • At the End: O(1)
  • At the Beginning: O(1)
  • In the Middle: O(n)
• Delete
  • From the Beginning: O(1)
  • From the End: O(n)
  • From the Middle: O(n)