Complexity of std::set constructor from sorted elements

Normally, constructing a rb-tree is O(N*log(N)) time.

However, initialization of std::set from sorted elements is linear time.

How does that work? Is there a sorted-check before initialization? Or search from the right-most one?

Read more here:

Content Attribution

This content was originally published by zjyhjqs at Recent Questions - Stack Overflow, and is syndicated here via their RSS feed. You can read the original post over there.

%d bloggers like this: