A hierarchical data structure is an organizational model where data elements are arranged in a tree-like structure, with a single root and multiple levels of nested nodes. This structure is efficient for representing relationships with a clear parent-child hierarchy, making it ideal for applications like file systems and organizational charts.