STL map internal implementation.

I was searching how map is internally implemented in STL.I am so glad if someone can help me on that.
Please share code also if you have.

Thanks,
Deepesh C.P

It's often implemented as a self-balancing binary search tree.
Can you share code to know how it is really implemented?
Thanks for your replay. I will go through that. If you can some code Please share that also.
By STL, do you mean the old library by SGI or the standard library?

If you mean std::map in the standard library there exist a number of different implementations. Here is the code for std::map in gcc: http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/include/bits/stl_map.h?revision=181394&view=markup
Thanks.....
The code for these templates is normally present in the header files you use, just check them out !
Topic archived. No new replies allowed.