On 8/16/2011 5:06 PM, bearophile wrote: > I think there are search trees like the Red-Black ones that guarantee a O(n ln n) worst case. I am wrong? Just feed it more data.