Self-referential data structures are data structures that include references to instances of the same type, enabling the creation of complex, interconnected data models such as linked lists, trees, and graphs. These structures are fundamental in computer science for managing dynamic data and implementing recursive algorithms efficiently.