title: What kind of tree implementation is STL set?
body: <p>I know that in STL <code>vector</code> represents the implementation of a dynamic array. So does the <code>list</code> represents the implementation of a  linked list (doubly linked list). I know that <code>set</code> has an implementation similar to tree . Looking at the algorithm complexity as mentioned most of the inbuilt function in set is of complexity <em>o(1)</em> or <em>o(log n)</em>. So is this tree implemented as Balanced Tree or any other kind of tree such as red-black tree and if So Why such a tree structure was chosen ?</p>