What is the time complexity of insert, delete, and search operations in a set data structure?

In the data structure std::set in C++ (implemented based on a red-black tree or a similar self-balancing binary search tree):

• Insertion (insert): O(log N)
• Deletion (erase): O(log N)
• Search (find): O(log N)

Where N is the number of elements in the set. The logarithmic complexity is due to the fact that the height of a balanced binary tree is proportional to the logarithm of the number of nodes.