I was unable to quickly find that information with Google.

However, set and friends are usually implemented using some kind of self-balancing binary tree, so you are safe to assume that amount of memory required is O(n). Constant may be rather huge, though — one node of red-black tree will store element and two pointers (plus alignment and something that I'm missing), so it can be ten-twenty bytes bigger than underlying type.