Template binary tree structure in standard library?

[Michael W. Hicks]

Hello,

I'm looking to use a templated binary tree type structure that provides
logorithmic insertion, retrieval and such. I'm familiar with the template<>
class map in the standard library, and while this would work, I've noticed
that map works with pairs consisting of keys and data. I'd prefer to have a
structure that could work directly with keys sans any other field. Does
anyone know of such a structure in the standard library? Is there a way to
modify the map template to use single element records?

Thanks,
Mike

 

[Artie Gold]

Hello,

I'm looking to use a templated binary tree type structure that provides
logorithmic insertion, retrieval and such. I'm familiar with the template<>
class map in the standard library, and while this would work, I've noticed
that map works with pairs consisting of keys and data. I'd prefer to have a
structure that could work directly with keys sans any other field. Does
anyone know of such a structure in the standard library? Is there a way to
modify the map template to use single element records?

Sure sounds like you want std::set to me!

HTH,
--ag

 

[Michael W. Hicks]

Sure sounds like you want std::set to me!

HTH,
--ag

Wow, that's exactly what I was looking for! Thanks!

- Mike