The data structure used to represent a hierarchy in programming is called a tree. Trees consist of nodes connected by edges, with a single root node at the top, leading to various child nodes. This structure is particularly useful for representing relationships, such as file systems or organizational charts. It allows for efficient searching, sorting, and retrieval of hierarchical data, making it a fundamental concept in computer science.