No trees in the stdlib?

[Paul Rubin]

Lawrence D'Oliveiro <ldo at geek-central.gen.new_zealand> writes:
> > With O(n) insertions and removals, though.  A decent self-balancing
> > binary tree will generally do those in O(log n).
> 
> For values of n below, say, a million, would you even notice the difference 
> on modern hardware?

Huh?  Yes, of course you'd notice, unless you were doing the operation
just once or something like that.