Strux
Well-tested, fully-documented, MIT-licensed data structures written in Swift that are compatible with Swift 4 and Swift 5. Currently it has four data structures:
Queue: a queue with O(1) addition and removal.
Heap: a min or max heap that can be used as a priority queue.
BSTree: a counted, self-balancing (AVL) binary search tree that conforms to the BidirectionalCollection
protocol, with O(N) in-order traversal, and O(1) height, count, first, last, median, and (if the type is numeric) sum.
DisjointSet: A disjoint set data structure, also known as union-find, or merge-find.