Is double link list a linear data structure? If Yes, Why?
If No, Why?

#### vasanthy Profile Answers by vasanthy

• Aug 24th, 2010

yes...

#### nirmal jena Profile Answers by nirmal jena

• Oct 1st, 2010

Yes

Because every node contain the address of next node

#### prasannaj Profile Answers by prasannaj

• Oct 22nd, 2010

Linear data structure means arrange of data in sequential manner. In double linked list every node is connected means sequential arrangement

• Jul 19th, 2011

yes it contains address of the next node

#### fouzia sultana

• Aug 8th, 2011

it is a linear data structure.. In other words we can say that its a two way linear data structure

#### Rajan Patekar Profile Answers by Rajan Patekar

• Aug 12th, 2011

yes the double linked list is linear data structure because each node contains the address of next node and so on.we can travel from last to first or first to last depending on the user.

#### snyder Profile Answers by snyder

• Mar 7th, 2012

To check if a DS is linear or not just do a simple test . . . check if the data elements of the given DS can be accessed in a sequential manner, if it can, then its a linear DS.

A doubly linked list can be accessed in a sequential manner, hence it is a linear linked list.

#### snyder Profile Answers by snyder

• Mar 13th, 2012

If every element in a DS has almost two adjacent neighbors then it is called a linear DS. . . Hence doubly linked list is a linear DS

Send   Reset