The efficency of adding to the middle of a list implemented with a linked chain is

O(n)
  • O(1)
  • O(n^2)
  • O(logn)

The location to insert the new node will need to be found.