# Explain the Disjoint Sets Data Structure

0 votes
249 views

## 1 Answer

+1 vote
by (user.guest)
selected by (user.guest)

Best answer
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.

## Related questions

0 votes
1 answer 228 views
+2 votes
1 answer 4.1k views
0 votes
1 answer 130 views
+1 vote
1 answer 726 views
0 votes
0 answers 98 views
0 votes
1 answer 264 views
+2 votes
1 answer 338 views
+2 votes
1 answer 1.3k views
0 votes
0 answers 105 views
+1 vote
1 answer 683 views
0 votes
0 answers 146 views
+1 vote
1 answer 701 views
+1 vote
1 answer 572 views
+1 vote
1 answer 281 views
+1 vote
1 answer 357 views
+1 vote
1 answer 477 views
+1 vote
0 answers 215 views
+1 vote
1 answer 1.9k views
0 votes
1 answer 953 views
0 votes
1 answer 570 views
0 votes
1 answer 661 views
0 votes
1 answer 1.1k views
+1 vote
1 answer 400 views
+1 vote
1 answer 2.3k views
0 votes
0 answers 445 views
+1 vote
1 answer 468 views
0 votes
1 answer 3.0k views
+1 vote
1 answer 340 views
+3 votes
1 answer 1.2k views
0 votes
1 answer 29 views
0 votes
1 answer 301 views
0 votes
1 answer 224 views
+1 vote
1 answer 712 views
+1 vote
1 answer 165 views
+1 vote
1 answer 276 views
+1 vote
1 answer 160 views
+1 vote
1 answer 216 views
+1 vote
1 answer 144 views
+2 votes
1 answer 228 views
+1 vote
1 answer 318 views
+1 vote
1 answer 576 views
+1 vote
1 answer 685 views
0 votes
0 answers 337 views
+1 vote
1 answer 816 views
+2 votes
1 answer 958 views
0 votes
1 answer 230 views
0 votes
1 answer 199 views
0 votes
1 answer 391 views
+1 vote
1 answer 183 views
+1 vote
1 answer 188 views