When you use a LinkedList class, you don't care for its implementation details
But linked list is the name of a specific implementation of a list. When a class is named LinkedList, I expect it to be implemented this way.
If you don't care about the implementation, it would be better to declare and use an interface named List that is implemented by classes named LinkedList or ArrayList.
Indeed, I should've used the term Abstract Data Type (ADT), not data structure.
Still, I don't think that LinkedList refers to the way it's implemented. For example, it's not uncommon for a tree to be implemented as two arrays: one to hold the index of the parent and the other to store the actual data. Such data structure could still expose all public methods as a tree, and you wouldn't have to know how it's implemented.
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
But linked list is the name of a specific implementation of a list. When a class is named
LinkedList, I expect it to be implemented this way.If you don't care about the implementation, it would be better to declare and use an interface named
Listthat is implemented by classes namedLinkedListorArrayList.Indeed, I should've used the term Abstract Data Type (ADT), not data structure.
Still, I don't think that
LinkedListrefers to the way it's implemented. For example, it's not uncommon for a tree to be implemented as two arrays: one to hold the index of the parent and the other to store the actual data. Such data structure could still expose all public methods as a tree, and you wouldn't have to know how it's implemented.