stl list - complexity

Question

Are all the inserts (anywhere) for the list constant?

What about access?

Front, back - constant time?

and in the middle of the list - linear time?

Answer 1

Inserts anywhere in a std::list are constant time operations.

That said, before you can insert, you need to get an iterator to the location you'd like to insert to, which is a linear time operation unless you're talking about the front or back.