Arc Forum
new
|
comments
|
leaders
|
submit
login
2 points
by
rkts
6159 days ago |
link
|
parent
> The haskell version is doing some balancing.
Balancing that causes remove to be O(n). Probably not a good idea.
2 points
by
raymyers
6159 days ago |
link
A more balanced tree will speed up 'find' and 'insert'. If those actions are performed far more often than 'remove', it would indeed be a good idea. Without knowing the use case, I cannot say which I would prefer.
-----
