Difference between linear and nonlinear data structure?

Linear DS:

1. every item is related to its previous and next time.

2. data is arranged in linear sequence.

3. data items can be traversed in a single run.

4. eg. array, stcks, linked list, queue.

5. implementation is easy

non-linear DS:

1. every item is attached with many other items.

2. data is not arranged in sequence.

3. data cannot be traversed in a single run.

4. eg. tree, graph

5. implementation is difficult.