vector  - iterator traversal possible

list  - iterator traversal possible

deque -  iterator traversal NOT possible

map - enables usage of  non-int index type

set - A set is a container that contains all unique values

templates - parametrized classes , works with differenc types , can be called class overloading

Iterators

I said that iterators are pointers, but there is more. They look like pointers, act like pointers, but they are actually embedded in which the indirection operator (unary *) and -> have been overloaded to return a value from the container. It is a bad idea to store them for any length of time, as they usually invalid after a value has been added or removed from a container. They are something like handles in this regard. The plain iterator can be altered, so that the container is to be traversed in different ways:

• iterator - For any container other than the vector, you can only step one at a time in a forward direction through the container. That is you can only use the ++ operator, not the -- or += operator on it. For vector only you can use any of +=, --, -=, ++, and all the comparison operators <, <=, >, >=, ==, !=.
• reverse_iterator - If you want to step backwards instead of forwards through a non-vector container, replace iterator with reverse_iterator, begin() with rbegin(), and end() with rend(), ++ will then traverse backwards.
• const_iterator - a forward iterator that returns a const value. Use this if you want to make it clear that this points to a read-only value.
• const_reverse_iterator - a reverse iterator that returns a const value.

Source : http://www.codeproject.com/vcpp/stl/PracticalGuideStl.asp

Source : http://www.cs.brown.edu/people/jak/proglang/cpp/stltut/tut.html ( Refer for a pictorial view of STL containers and iterators )

The Standard Template Libraries (STL's) are a set of C++ template classes to provide common programming data structures and functions such as doubly linked lists (list), paired arrays (map), expandable arrays (vector), large string storage and manipulation (rope), etc. The STL library is available from the STL home page. This is also your best detailed reference for all of the STL class functions available.

STL can be categorized into the following groupings:

• Container classes:
  • Sequences:
    • vector: (this tutorial) Dynamic array of variables, struct or objects. Insert data at the end.
    • deque: Array which supports insertion/removal of elements at beginning or end of array
    • list: (this tutorial) Linked list of variables, struct or objects. Insert/remove anywhere.
  • Associative Containers:
    • set (duplicate data not allowed in set), multiset (duplication allowed): Collection of ordered data in a balanced binary tree structure. Fast search.
    • map (unique keys), multimap (duplicate keys allowed): Associative key-value pair held in balanced binary tree structure.
  • Container adapters:
    • stack LIFO
    • queue FIFO
    • priority_queue returns element with highest priority.
  • String:
    • string: Character strings and manipulation
    • rope: String storage and manipulation
  • bitset: Contains a more intuitive method of storing and manipulating bits.
• Operations/Utilities:
  • iterator: (examples in this tutorial) STL class to represent position in an STL container. An iterator is declared to be associated with a single container class type.
  • algorithm: Routines to find, count, sort, search, ... elements in container classes
  • auto_ptr: Class to manage memory pointers and avoid memory leaks.