Aanuoluwapo Babajide 1f5134b368 Create alternate_disjoint_set.py (#2302) ... * Create alternate_disjoint_set.py This code implements a disjoint set using Lists with added heuristics for efficiency Union by Rank Heuristic and Path Compression * Update alternate_disjoint_set.py Added typehints, doctests and some suggested variable name change * Update alternate_disjoint_set.py * Formatted with Black * More formatting * Formatting on line 28 * Error in Doctest * Doctest Update in alternate disjoint set * Fixed build error * Fixed doctest		2020-08-28 18:25:02 +02:00
..
binary_tree	lazy_segment_tree.py-style-fixes (#2347)	2020-08-24 09:52:02 +02:00
disjoint_set	Create alternate_disjoint_set.py (#2302)	2020-08-28 18:25:02 +02:00
hashing	isort --profile black . (#2181)	2020-07-06 09:44:19 +02:00
heap	removed redundant data_structures folder (#2256)	2020-07-31 20:36:02 +02:00
linked_list	Fix doubly linked list algorithm (#2062)	2020-08-02 23:55:18 +08:00
queue	change method name from front to get_front (#1943)	2020-05-06 11:19:44 +05:30
stacks	Optimization and fix bug (#2342)	2020-08-21 14:39:03 +08:00
trie	Set the Python file maximum line length to 88 characters (#2122)	2020-06-16 10:09:19 +02:00