Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
If I insert an ordered (increasing) sequence of elements into a map, will the final binary tree be somehow optimized? Or will every element have a child “to it’s right”? That would make such a tree very inefficient, since then the lookup would be linear.
I couldn’t find any detailed information about the insertion process into STL map.
The C++11 standard (23.1) mandates logarithmic complexity for both
insertandfindfor associative containers. Constructing them from two iteratorsiandjsuch that[i, j)denotes a suitably sorted range of values is even required to have linear time complexity. Whether that means that “the final binary tree is optimized”, or whether maps are binary trees at all, is left unspecified.In practice, though,
std::set,std::mapand their multi-friends are virtually always red-black trees, since that’s what the original HP/SGI reference implementation of the STL had, and all modern C++ libraries that I know derive from that implementation.