std::set in 10 Minutes: Big-O, Red-Black Trees and Ordered Lookup TomJNET September 16, 2026 Leave a Comment on std::set in 10 Minutes: Big-O, Red-Black Trees and Ordered Lookup Posted in Seen Them Share: XFacebookPinterestLinkedin Everything you need to use std::set well, in under ten minutes. How a set is laid out in memory (a red-black tree with one heap … source Author: TomJNET