Which database model stores data in a tree-like structure with parent records linked to a root?

• A. hierarchical database
• B. information system
• C. personal geodatabase
• D. relational database

Answer: (A)

Hierarchical databases store data in a tree-like structure with a root and parent–child links. Each child record has a single parent, while a parent can have many children, forming branches that originate from the root. This arrangement naturally represents strict hierarchies, such as organizational charts or directory structures, where you can trace a path from the root down to any node. The description in the question—data organized as a tree with parent records linked to a root—fits this model exactly.

Relational databases use tables connected by keys, which is flexible for many types of relationships but not inherently a tree structure. An information system is a broad term, not a specific data model. A personal geodatabase is a GIS format that can implement various models, but it isn’t defined by a tree-like hierarchy.