Which level of database describes records that have a strict parent-child relationship?

The answer is the hierarchical database, which is characterized by its organization of data into a strict tree-like structure where each record has a clear parent-child relationship. In a hierarchical database, each parent can have multiple children, but each child can only have one parent. This structure is akin to a family tree, where you can easily trace a lineage from parents to children but not vice versa.

Hierarchical databases excel in situations where the data naturally forms a hierarchy, making it easy to navigate through layers of records. This model allows for efficient access and navigation, as you can quickly drill down from parent to child nodes.

In contrast, network databases allow records to have multiple parent-child relationships, making them more flexible but less strictly hierarchical. Relational databases organize data into tables and use keys to define relationships, which do not conform to a strict hierarchical structure. Flat file databases store records in a single, non-relational structure without the complexities of parent-child relationships. Therefore, the hierarchical database is the correct choice for describing records with a strict parent-child relationship.