Re: Optimal Structure for Inserting and Deleting

>        But above all, what do you want to do with the list?

I think that's the main question. Do you need to do heavy processing
on very long lists? Then choose a very efficient data structure.
Or do you modify reasonably short lists every once in a while? Then
just use a List<T> and be done with it. (That's not efficient for
insertions/deletions at other places than the end, but for such a
scenario, that won't matter anyway.)

It all depends...

Fabian

===================================
This list is hosted by DevelopMentor®  http://www.develop.com

View archives and manage your subscription(s) at http://discuss.develop.com