Register

Linked list

1,018 views
0 votes
0 votes
When are linked lists considered linear data structures?

A) If it is based on storage

B)If it is based on access strategies

C) Both a and b

D) Neither a and b
User Avatar

1 Answer

1 votes
1 votes
its is linear based on the accsess strategy  of the data structure.
if we consider the storage pattern of linked list it is a random data structure
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

264
views
1 answers
0 votes
Mrityudoot asked Feb 25
264 views
Linked List
How can we find the highest element in a singly linked list in O(1)? We are free to use any extra space.
User Avatar
807
views
1 answers
1 votes
Souvik33 asked Jan 11, 2023
807 views
Made Easy Test Series | Prog And DS | Linked List
The following C function rearranges the members of a single-linked list of integers that is passed as a parameter. The list of numbers 1, 2, 3, 4, 5 ... How many components will move about in the list once the function is finished running?
User Avatar
730
views
1 answers
1 votes
ykrishnay asked Aug 5, 2022
730 views
data structure and algorithms -- linked list -- size of a node
as we allocate the space for node in linked list using malloc() so how many bytes malloc allocate for the 1 node i.e. actual value of malloc allocates in ram like ... )); printf("%d",sizeof(struct node)); } what the printf prints and why ?
User Avatar
537
views
2 answers
9 votes
GO Classes asked May 4, 2022
537 views
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 8
If $f(n) = O(g(n))$ and $f(n) = \Omega(g(n)),$ then it is always true that$f(n) = o(g(n)).$f(n) = \theta(g(n)).$f(n) = \omega(g(n)).$both A and B are always true.
User Avatar
Link Copied!