Message176713
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. |
|
Date |
User |
Action |
Args |
2012-11-30 20:33:05 | koniiiik | set | recipients:
+ koniiiik, lemburg, arigo, gregory.p.smith, mark.dickinson, vstinner, 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:04 | koniiiik | link | issue14621 messages |
2012-11-30 20:33:04 | koniiiik | create | |
|