We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 4b4d770 commit 1d6249dCopy full SHA for 1d6249d
README.md
@@ -62,7 +62,7 @@ the data.
62
* `A` [Segment Tree](src/data-structures/tree/segment-tree) - with min/max/sum range queries examples
63
* `A` [Fenwick Tree](src/data-structures/tree/fenwick-tree) (Binary Indexed Tree)
64
* `A` [Graph](src/data-structures/graph) (both directed and undirected)
65
-* `A` [Disjoint Set](src/data-structures/disjoint-set)
+* `A` [Disjoint Set](src/data-structures/disjoint-set) - a union–find data structure or merge–find set
66
* `A` [Bloom Filter](src/data-structures/bloom-filter)
67
* `A` [LRU Cache](src/data-structures/lru-cache/) - Least Recently Used (LRU) cache
68
0 commit comments