STL:: MAP<char> Data Structure Used</char>

[Anil Kumar Arvapalli]

Hi Friends Iam Very new to STL i want to know what Data Structures are used in MAP internally to search or to insert or to delete. can any body let me know this is assignment assigned by my teacher...... Thanks in Advance....

[theCPkid]

You can download the stl source code from [^] Since, this is your assignment, you should solve it. HINT : check map.h and other files included in it.

[TimothyPMoore]

It can vary from implementation to implementation but I believe that most use a balanced binary tree.

[Stuart Dootson]

It all depends on the implementation. And anyway, if this is YOUR assignment, assigned by YOUR teacher, then YOU should be doing the work of finding out the answer, not asking someone else to do it - look at the source code.

Java, Basic, who cares - it's all a bunch of tree-hugging hippy cr*p

[Stephen Hewitt]

The STL standard doesn't specify how a std::map is coded but rather its interface, which includes the complexity[^] of various operations. However, the complexity constraints and interface limit the choices. Generally a Red-black tree[^] is used.

Steve