In mathematics disjoint sets can be defined as sets that do not have any elements in common; in other words, their intersection is empty. Extending this definition to computer science, the disjoint sets data structure is a one used to refer to sets that do not overlap, storing a partition of a set into disjoint subsets.