Which is a standard example of a hierarchical data structure used in computer science?

Introduction / Context:
Hierarchical data structures organize elements in parent child relationships. The most common structure with this property is the tree, which underpins file systems, parsers, and many indexing strategies.

Given Data / Assumptions:

• We are comparing common data structures.
• Hierarchy implies nodes with ancestors and descendants.
• Linear structures do not satisfy hierarchy.

Concept / Approach:
A tree has a root node and subtrees that form levels. Operations such as traversal, insertion, and search exploit this shape. Variants include binary trees, B trees, and tries, all maintaining hierarchical relationships that enable logarithmic behavior in many cases.

Step-by-Step Solution:

Verification / Alternative check:
Check the presence of parent child edges and levels. Only trees satisfy that property here.

Why Other Options Are Wrong:

Common Pitfalls:
Confusing directory trees with arrays or assuming links imply hierarchy can lead to errors.

Final Answer:
Tree.