Is a doubly linked list a nonlinear data structure or a linear data structure?

Question

A linear data structure sequentially intersects data elements into which only one data element can be reached. Example: arrays, linked lists.

But in a doubly linked list, we can achieve two data elements using the previous pointer and the next pointer.

So, can we say that a doubly linked list is a non-linear data structure?

Correct me if I am wrong.

Thank.

Answer 1

, , . ( ) , /, . .

: - , , ... .., .

( ), ( ) ( ). .

, . (.. ).

Answer 2

; 2 :

• 2 node, , node, node .
• - , .

Answer 3

- : , , , .

, .

Answer 4

A linked list is basically a linear data structure because it stores data in a linear fashion. A linear data structure is what stores data in a linear format, and moving is done sequentially, not zigzag.