This is a follow up to this question:
Pointer into Java LinkedList Node
C#'s LinkedList
implementation is a list which is composed of LinkedListNodes
, and such it enables to have a reference to a specific node AND can remove that node or add after/before that node in O(1).
Is there any Java list implementation which supports these actions with the same run time complexity? If not the ability to save the nodes themselves, then direct indexing is also a good option