Jumping into C++

vector a_vector( 10 );

name_to_address.empty()

#include

no-no. In a binary tree, you can’t promote a node up the tree willy-nilly.

The iterator, when you dereference it, has two fields, first and second. The first field is the key, and the second field is the value.

name_to_email[ "Alex Allain" ] = "webmaster@cprogramming.com";

The SGI has a website with a great deal of STL documentation: http://www.sgi.com/tech/stl/. Another good resource is Scott Meyer’s book Effective STL, which will introduce you to many STL concepts and idioms. The site http://en.cppreference.com/w/cpp also has excellent documentation for many STL elements and while not meant as an introduction to th

It would be ideal to have a balanced tree,

for ( vector ::iterator itr = vec.begin(); itr != vec.end(); ++itr )