clickankit4u

 Profile Answers by clickankit4u 

• Feb 10th, 2009

 

Linear Data Structure consist of single linked list, array
while non-linear linked list are like tree, graph.

manihclcodc

 Profile Answers by manihclcodc 

• Mar 6th, 2009

 

In linear data structure, you can traverse all the elements in one direction. There is no coming back. But, in non-linear, it is opposite.

ankscorek

 Profile Answers by ankscorek 

• Mar 16th, 2009

 

Linear DS are used in fast computer memories and non linear are used in secondary storage disks.

piyushbeli

 Profile Answers by piyushbeli 

• Apr 14th, 2009

 

Is it not vice-versa. Non linear should be for fast memory access and linear for
data storage. Because traversing thru non linear data structure is always less
time consuming.

vinod148

 Profile Answers by vinod148 

• Oct 23rd, 2009

 

Linear:
     May not need pointers to access
    
Need more time for searching than non-linear
     Easier to access

Non-linear:
     Need pointers to access
    
Take less time depends on the data structure
     Need pointers to access

sureshds

 Profile Answers by sureshds 

• Dec 26th, 2009

 

If the elements/nodes have a single successor and predecessor then the list is said to be linear.

Stacks and queues are Linear.
Linked lists are linear in terms of accessing and non-linear interms of storage.

Trees and graphs are pure non-linear.