Michal Petrucha added the comment: 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. ---------- _______________________________________ Python tracker <rep...@bugs.python.org> <http://bugs.python.org/issue14621> _______________________________________ _______________________________________________ Python-bugs-list mailing list Unsubscribe: http://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com
