>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 ;-)
My regards
Axel
-----Original Message-----
From: Murphy, James [mailto:[EMAIL PROTECTED]]
Sent: Montag, 29. April 2002 18:19
To: [EMAIL PROTECTED]
Subject: Re: [DOTNET] newbie question: no tree class?
> (although not explicitly specified as such, std::map is almost
> certainly implemented as a balanced tree).
I think you mean binary tree - which can get very unbalanced. I agree
with
the rest of what you post - why not write one?
Jim
You can read messages from the DOTNET archive, unsubscribe from DOTNET,
or
subscribe to other DevelopMentor lists at http://discuss.develop.com.
You can read messages from the DOTNET archive, unsubscribe from DOTNET, or
subscribe to other DevelopMentor lists at http://discuss.develop.com.
