**Shilpi**
Answered On : Jun 18th, 2006

Linear datastructures : Linklist (traversal is linear in nature)Nonlinear : graphs, trees (traversal of nodes is nonlinear in nature)

1 User has rated as useful.

Login to rate this answer.

**aditya**
Answered On : Sep 16th, 2006

Linear data structures:- in which insertion and deletion is possible in linear fashion .example:- arrays, linked lists.Non linear data structures:-in which it is not possible. example:- trees ,stacks

Login to rate this answer.

**Pushpa**
Answered On : Dec 12th, 2006

Linear data structures : Arrays, Linked ListNon-Linear data strctures :trees, Graphs

Login to rate this answer.

Linear DS: traversals are linear. (eg: array)Non linear DS: traversals are not linear (eg. tree).

Login to rate this answer.

Graph,Tree

Login to rate this answer.

Linear---array,linked listNon linear--tree,graph

Login to rate this answer.

A data structure is classified into two categories: Linear and Non-Linear data structures. A data structure is said to be linear if the elements form a sequence, for example Array, Linked list, queue etc. Elements in a nonlinear data structure do not form a sequence, for example Tree, Hash tree, Binary tree, etc. There are two ways of representing linear data structures in memory. One way is to have the linear relationship between the elements by means of sequential memory locations. Such linear structures are called arrays. The other way is to have the linear relationship between the elements represented by means of links. Such linear data structures are called linked list.

2 Users have rated as useful.

Login to rate this answer.

**Aditya Ranjan**
Answered On : Aug 9th, 2011

A data structure in which every data element has got exactly two neighbors or two adjacent elements except two elements having exactly one data element is called a linear data structure.Otherwise it is called a nonlinear data structure.

Login to rate this answer.

Linear data structures are:array,linked list,stack and queue.

non-linear data structures are :tree and graph.

Linear data structure: a data structure which is sequential and continues in nature i.e. access the data in sequential manner.

Non-linear data structure: a data structure which is not sequential.

Login to rate this answer.

**chandu**
Answered On : Aug 13th, 2011

Linear : stack, arrays, linked listNon-linear : trees ,graphs

Login to rate this answer.

**Amraan**
Answered On : Sep 7th, 2011

Linear data structure is those in which data are arranged in specific manner i.e data are arranged consecutively.example are array,stack and queue.

Where as in non-linear data are arranged dynamically.examples are list link ,graph and trees.

Login to rate this answer.

**Ravi**
Answered On : Sep 8th, 2011

In Linear data structure we can not insert item in middle place but in non linear we can do so.

Login to rate this answer.

**simran yadav**
Answered On : Sep 17th, 2011

A data structure is linear if every item is related with next and previous item and it is non linear if it is attach with many of the items in specific ways to reflect relationship

Login to rate this answer.

**meiyammai.k**
Answered On : Sep 18th, 2011

Linear data structures are in which all the data are arranged in sequence manner.for example:linked list,stack queue

Non linear data structure are in which all the data are arranged in random manner.for example :trees,graphs.

Login to rate this answer.

**izedonmi ezekiel awele**
Answered On : Apr 3rd, 2012

Linear data structure is such that they are contiguous either by their arrangement in successive memory locations or by means of pointers. To help you understand it better, let say you were given a book, and asked to copy out some items of information from it, Mr.A decided that his hand writing would be big and eligible so it, cost him three A4 size papers to copy out the information, while Mr.B said he is going to reduce the size of the letters so it can enter just one page, he did just that Mr.A having used three sheets had to join them with a staple pin(pointer) in manner 1,2,3 ( he numbered the pages), but Mr.C did the same as Mr.A but going through it he found out that the item of information on page 3 would help him understand that of page 2 so he stapled it in the order 1,3,2 (non-linear data structure). thanks

Login to rate this answer.