alleryStart learning →A linked list can only be walked from the front, which means it supports:
ASequential access
BSelective access
CSymmetric access
DSimultaneous access
Answer & Solution
Correct answer: A. Sequential access
1. Each node only knows the next node.
2. You must follow the links in order.
3. So it supports sequential access.
_Source: OpenStax Introduction to Computer Science, Chapter 3, Data Structures and Algorithms._
Keep practising Data Structures and Algorithms
Browse all Data Structures and Algorithms questions for CS Olympiad, or explore more Computer Science topics.
Related questions
An algorithm that repeatedly picks the option with the best immediate benefit is:The canonical divide and conquer comparison sorting algorithm is:An algorithm that splits a problem in half, solves each half and combines results is calleBinary search on a sorted list has an order of growth of:Sequential search through a list of N words has a worst case order of growth of:The notation used to describe worst case order of growth is:Binary search requires that the list it searches is first:A structure that represents binary relations among a collection of entities is a: