How is the time complexity of adding an element to the std::list container evaluated?

Adding an element to a std::list container has a time complexity of O(1) if you have an iterator to the insertion position. This is because std::list is implemented as a doubly linked list, and inserting an element only requires reassigning the pointers of neighboring nodes, without the need to move other elements.