Axel Heitland wrote: > From what I know std::map is indeed using a balanced tree since the > lookup time in a map should have log(n)-complexity.
> However there might exist some dumb std::map's out there ;-) By definition, std::map must have log(n) lookup; given the other requirements, that pretty much demands a balanced tree. Every implementation I've seen uses red/black trees. Brad -- Read my web log at http://www.quality.nu/dotnetguy/ You can read messages from the DOTNET archive, unsubscribe from DOTNET, or subscribe to other DevelopMentor lists at http://discuss.develop.com.
