What type of database organizes related information in a tree-like structure?

A hierarchical database organizes related information in a tree-like structure, which allows for a parent-child relationship among the data. In this type of database, each record has a single parent, but can have multiple children, reflecting a clear hierarchy. This structure is particularly effective for representing data with a unidirectional relationship where data is organized in levels.

For instance, an example of a hierarchical database would be an organizational chart for a company or a file system where directories can contain subdirectories. The tree-like format enables efficient data retrieval, as one can navigate down the branches of the tree to locate specific data.

While other types of databases like personal geodatabases and relational databases exist, they do not inherently utilize a tree structure. A personal geodatabase is more focused on geographical data and local storage, while relational databases organize data into tables that can relate to each other through key fields, providing a more flexible approach to data organization but not in a hierarchical manner. Information systems encompass a broad range of systems and could include databases of any type, but do not specifically define the structure of the data organization as hierarchical databases do.