ok exploring the STL <set> if you entered the values say 1 to 1000 in order would it auto balance?....i thought no but then a friend of mine told me about this "red and black" tree and if i test the result times to find an element (random and numeric insertion) there is only a difference of like 2e-6s (which makes think the tree does auto balance) so anyone please help me understand what is going on
blcase 0 Newbie Poster
sarehu 84 Posting Whiz in Training
It does auto-balance.
bugmenot 25 Posting Whiz in Training
vijayan121 1,152 Posting Virtuoso
the c++ standard only specifies the performance requirements: for insert, erase and find
this is O( log N ). to meet this requirement, any tree implementation must be (reasonably) balanced at all times.
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.