How is the time complexity of searching for an element in std::map determined?

In std::map, the element lookup uses a balanced binary tree (usually a red-black tree), so the time complexity of element search is O(log n), where n is the number of elements in the container. This is because the search compares the element with tree nodes, moving either to the left or right subtree, halving the search space at each step.