On Jun 27, 2007, at 10:58 PM, Pal-Kristian Engstad wrote:

> Quôc Peyrot wrote:
>> I don't understand that part. Each time you add a node, log2(n)  
>> node needs to be re-allocated. Hence the total number of  
>> reallocations is:
>> Sum(ceil(log2(i)), i = 1..N) with N = 1000000, which is significant.

Oops, my mistake I meant "floor" not ceil.

> So you are saying that inserting N elements into a tree takes O 
> (n*log2(n)).

Not exactly, log2(N!) is a closer estimate (estimate because of the  
"floor" introducing a bias in the sum)

-- 
Best Regards,
Quôc