Interested to Buy Any Domain ? << Click Here >> for more details...
example of linear and non-linear data structures?
- 9 Answers
- 69965 Views
- Aricent, Infosys, I also Faced
- E-Mail Answers
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
Is arraylist a collection?
What is sequential search? What is the average number of comparisons in a sequential search?
Differentiate between the singly linked list and doubly linked list.
What are the disadvantages of using collection classes over arrays?
Is heap sort stable?
What is linked list ?
State the merits of linear representation of binary trees?
Why do we need to recycle?
Mention the advantages of representing stacks using linked lists than arrays?
what is traversal in linked lists?
Tell me do array subscripts always start with zero?
Why do we need linked list?
Write is a binary search tree? Write an algorithm and tell complexity?
Define heap order property?
What is lifo?
