On Fri, Dec 23, 2005 at 14:28:31 -0800, ST wrote: > Thanks, that actually makes sense. Could it also be that if they want > to > add something to the list they first dump it at the end of the list and > defer the insertion of the irem to the tree since it takes more time to > inset in the tree and balance the red-black tree? There is no way to amortize insert complexity in a red-black tree so that lazy inserts would make sense. And search trees are there for quick lookup, which basically requires them always being fully built. -- Jan 'Bulb' Hudec <bulb@xxxxxx>
Attachment:
signature.asc
Description: Digital signature
