complexity of list insert() and erase() is wrong in Data structures in C++.pdf

[girishkuniyal]

The complexity for both insert() and erase() operation for list is mentioned as O(N) in Data structure in C++.pdf
but list is doubly linked list representation. which facilitate bi-direction iterator and
constant time O(1) insertion and erase operation.
by the way cheat-sheet is awesome.