Comprehensive package of Python-native datastructures.
- tree set
- ordered list (?) = binary tree with duplicates (counts)
- trie
- disjoint set (forest)
- graph (weighted or not, directed or not, sparse or not)
- Heap (AKA priority queue)
- TreeMap
- fixed-size array
- dynamic array (use
list
) - linked list (use
collections.deque
) - stack (use
collections.deque
orlist
) - queue (use
collections.deque
) - deque (use
collections.deque
) - hash set (use
set
) - hash map (use
dict
)