example of linear and non-linear data structures?
Answer Posted / sneha rajput
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.
| Is This Answer Correct ? | 4 Yes | 0 No |
Post New Answer View All Answers
What is height balanced tree?
why boundary tag representation is used?
how to display Singly Linked List from First to Last?
Can arraylist hold different types?
What is adt example?
Explain Array of pointers?
What is the use of sorting the data?
Define in brief an array. What are the types of array operations?
Define linear probing?
What is arraylist load factor?
Are dictionaries mutable?
How does the size of arraylist increases dynamically?
Difference between arraylist and linkedlist?
State the merits of linear representation of binary trees?
Is arraylist better than array?