The STL provides class templates that process lists, stacks, and queues. In a linked list, the order of the elements is determined by the order in which the nodes were created

to store the elements. Iterators are used to step through the elements of a container. A vector container stores and manages its objects in a static array. An iterator is generated by member functions of containers. The functions begin, rbegin, rend, etc are members of iterators. The statement vector vec[5] declares a vector of 5 elements. A linked list is a dynamic data structure. Item insertion and deletion from a linked list does not require data movement. The search on a linked list is sequential.