Author koniiiik
Recipients Arfrever, Giovanni.Bajo, PaulMcMillan, ReneSac, Vlado.Boza, alex, arigo, benjamin.peterson, camara, christian.heimes, cvrebert, dmalcolm, gregory.p.smith, haypo, koniiiik, lemburg, mark.dickinson, sbermeister, serhiy.storchaka, Łukasz.Rekucki
Date 2012-11-30.20:33:04
SpamBayes Score -1.0
Marked as misclassified Yes
Message-id <20121130203303.GA14181@ksp.sk>
In-reply-to <1354305992.63.0.159104942898.issue14621@psf.upfronthosting.co.za>
Content
On Fri, Nov 30, 2012 at 08:06:32PM +0000, Serhiy Storchaka wrote:
> René, a balanced tree requires rebalancing on every (or almost
> every) item for some special (sorted) data sequences.

That's perfectly true and it holds for most unsorted sequences as
well -- that's why they are balanced. The fact that the tree is always
balanced guarantees that each rebalance takes at most O(log n)
operations.
History
Date User Action Args
2012-11-30 20:33:05koniiiiksetrecipients: + koniiiik, lemburg, arigo, gregory.p.smith, mark.dickinson, haypo, christian.heimes, benjamin.peterson, Arfrever, alex, cvrebert, dmalcolm, Giovanni.Bajo, PaulMcMillan, serhiy.storchaka, Vlado.Boza, sbermeister, camara, Łukasz.Rekucki, ReneSac
2012-11-30 20:33:04koniiiiklinkissue14621 messages
2012-11-30 20:33:04koniiiikcreate