A linear data structure organizes elements in a single sequence, so that every element except the first has one predecessor and every element except the last has one successor. Traversal moves through the elements in one pass along that sequence. An array satisfies this definition: elements occupy contiguous memory locations and are addressed by index, which gives constant-time access to any position. Other linear structures include linked lists, stacks, and queues. A tree, option C, is a hierarchical, non-linear structure in which a node can have several children, and moving through it requires traversal strategies such as depth-first or breadth-first search that do not follow a single line. A graph, option A, is similarly non-linear; it consists of vertices joined by edges that may form cycles and allow any node to connect to any number of others, making it suitable for modeling networks and relationships. The linear versus non-linear classification affects storage layout, traversal cost, and suitability for tasks such as searching, sorting, or representing connections. Selecting an appropriate structure is part of the foundational computing knowledge that supports efficient data processing in data science work. Reference: Data Science Fundamentals Study Guide – Data Science Concepts: Data Structures (Linear and Non-Linear Structures).
===============
Contribute your Thoughts:
Chosen Answer:
This is a voting comment (?). You can switch to a simple comment. It is better to Upvote an existing comment if you don't have anything to add.
Submit