What is linear data structure in c?

Linear data structure is those type of data structure in which every element has at most one successor and almost one predecessor. That means linear data structure is those type of data structure in which after an element at most one element can be present and similarly before an element maximum one element can be present. It is also possible to say an element can have one child at most at most one present in the Linear Data Structure.

Linear data structure is divided in the following categories :-

Stack

Queue

List