The STL is a collection C++ libraries that allow you to use several well known kinds of data structures with out having to program them. They are designed so that the code runs efficiently. The compiler does most of the work of generating the efficient implementations. The libraries include a large number of possibilities. I describe some of things you can do with the STL versions of stacks, queues, vectors, and lists. I define some important and useful ideas in the Glossary below. The is a table summarizing the methods used with stacks, queues, vectors and lists at Summary below. For each kind of data structure I give working examples of how to declare, access and use objects of that type. C arrays were designed so that they could be accessed by using a variable that stores the address of an item. These variables are called pointers. They are used like this with an array: All Containers C in the STL have a number of iterator objects. Container class C has an iterator called If you change your choice from a vector to a list then the code is almost identical. This makes your code easier to modify. If the standard <,list>, and <,vector>, is not found then you are using an older C++ compiler. You may still be able to a slightly different form of stack and queue however: [ Older Stacks ] [ Older Queues ] On some older compilers and currant libraries when you need a <,string>, as well as either <,list>, or <,vector>, you need to . . . . . . . . . ( end of section The C++ Standard Template Library) <,<,Contents | End>,>, Source.