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 are linked list?
What is difference between while and do while?
Given an unsorted linked list, and without using a temporary buffer, write a method that will delete any duplicates from the linked list?
What is different between array and list?
Why is null not allowed in concurrenthashmap?
Explain the steps to insert data into a singly linked list?
What are the disadvantages of linked list?
Can arraylist contain duplicates?
Write the importance of hashing?
How does hashset maintain order?
Differentiate between arraylist and linkedlist.
Is duplicate allowed in hashmap?
Are data structures important?
Why we use arraylist instead of linked list?
How does quick sort work?