Differences between vector list deque

Vector is a continuous memory block, while deque is multiple consecutive memory blocks. list is the storage of all data elements separately. It can be that any two elements are not consecutive. The query performance of vector is the best, and it is also good to add data at the end, unless it applies for a memory segment again; suitable for efficient Random storage.
List is a linked list. Any element can be discontinuous, but it has two pointers pointing to the previous element and the next element. Therefore, it has the best performance for inserting and deleting elements, while the query performance is very poor. It is suitable for a large number of insert and delete operations without worrying about random access requirements.
Deque is between the two. It takes into account the advantages of arrays and linked lists. It is a combination of chunk linked lists and multiple arrays. Therefore, it has the query performance of list, and the insertion and deletion performance of vector. If you need to immediately access and care about data insertion and deletion at both ends, deque is the best choice.