User talk:Humpback

From Wikipedia, the free encyclopedia

[edit] Red-black trees and O(log n) height

I'm confused about your edit comment that you disagree that red-black trees have O(log n) height. This is a proven theorem about the data structure. Perhaps you're using a different definition of height, or a variant of the data structure? Deco 04:11, 13 Jan 2005 (UTC)