C + + STL list resolution (3)---"C + + STL" __c++

Details: https://zcheng.ren/2016/08/24/STLList/

C + + implemented vector since it cannot be implemented to quickly delete and insert elements, the STL designer then proposes to use list to solve the problem: through the memory of discontinuous space allocation node, through the link to operate, can quickly achieve this advantage.
The nodes of the list include: pointer prev to the previous node, pointing to the pointer to the back node next;
Iterator is implemented with a pointer to the list node.
Attention:
1 list is a two-way linked list, and is a circular two-way linked list, the iterator must have the ability to move forward, backward;
2 The iterator of list is a bidirectional iterator, namely bidirectional iterator.