I don't think that this is the case, since STL vector elements are guaranteed to reside consecutively.
I find black & red trees appropriate for STL sets and maps.
While I do understand that the STL spec. does not specify any specific implementation, I would assume that:
1) vectors are implemented as arrays
2) lists implementation is still by means of lists (nodes and pointers)
3) maps, sets etc. are implemented as black & red trees
Yes I do understand that the implementation is not part of the standard (only the big O notation is).
Looking at the internet I could not find a definite answer.
The bottom line is that I did well in the interview, but would like to confirm the above 3 statements for the next interview
This post has been edited by skyhawk133: 16 March 2011 - 02:40 PM