Is Linked List an ADT or is it a Data Structure, or both?

From wikipedia on ADT : In computing, an abstract data type (ADT) is a mathematical model for a certain class of data structures that have similar behavior so, linked list is an ADT, and every ADT is also a data structure, so linked list is both.

From wikipedia on ADT: In computing, an abstract data type (ADT) is a mathematical model for a certain class of data structures that have similar behavior so, linked list is an ADT, and every ADT is also a data structure, so linked list is both. EDIT: however, notive that singly-linked-list, and doubly-linked-list, both have the same oporations and the same complexity for these oporations, so they are both a linked list ADT, and we do not distinguish between them as ADT concerned. But, they are different data structures!

A linked list itself is not abstract, it's concrete. It's considered a data structure. Time complexity of accessing data in a linked list will depend on which element your accessing and how many elements are in the list, as you have to iterate through them to get to your desired element.

en.wikipedia.org/wiki/Linked_list.

A linked list is an ADT. The 'abstract' in Abstract Data Type doesn't refer to the fact that it is not concrete, but rather to the fact it can be used without knowing what is the actual data that will be stored in it (for example, in C, the data will be held as void*) – amit Jun 30 at 18:16 My bad, mistook abstract data type for an abstract class. – MGZero Jun 30 at 18:17.

I cant really gove you an answer,but what I can give you is a way to a solution, that is you have to find the anglde that you relate to or peaks your interest. A good paper is one that people get drawn into because it reaches them ln some way.As for me WW11 to me, I think of the holocaust and the effect it had on the survivors, their families and those who stood by and did nothing until it was too late.