Any O(log n) find time complexity datastructure that is not a map?

[OmairIqbal95]

Any O(log n) find time complexity datastructure that is not a map.

[Repeater]

An ordered tree comes to mind as a datastructure that can be searched in O(log n) time.

[coder777]

A set. See:

http://www.cplusplus.com/reference/set/set/find/

[jonnin]

a sorted vector / binary search.

[dhayden]

An ordered tree comes to mind

std::map is usually implemented as a red-black tree.
A set. More specificallym, std::set is a red-black tree and std::map is basically a std::set<std::pair<key,value>>

If you're actually looking for something faster than O(log N) then consider a hash table (unordered_set)

[helios]

How often do you need to add or remove elements from the data structure?