Which of the following is a canonical example of a hierarchical data structure used in computer science?

Introduction / Context:
Data structures organize information to support efficient operations. Understanding which structures are hierarchical versus linear is foundational for algorithm design and system modeling.

Given Data / Assumptions:

• We compare common structures: arrays, linked lists, and trees.
• We must select the hierarchical one.

Concept / Approach:
A hierarchical structure organizes elements in parent–child relationships forming levels. A tree is the archetypal hierarchical structure, supporting operations like traversals (preorder, inorder, postorder) and representing hierarchical data (filesystems, DOMs, organizational charts).

Step-by-Step Solution:

Verification / Alternative check:
Check typical use cases: hierarchical menus, file directories, and parse trees all use tree structures.

Why Other Options Are Wrong:
Arrays and linked lists are linear, not hierarchical; 'All of the above' would be incorrect.

Common Pitfalls:
Confusing ”graph” (general) with ”tree” (acyclic, connected); while graphs can represent hierarchies, trees are the classic hierarchical data structure.

Final Answer:
tree