kanthuc 2eaacee7b4 lowest_common_ancestor.py static type checking (#2329) ... * adding static type checking to basic_binary_tree.py * Add static type checking to functions with None return type * Applying code review comments * Added missing import statement * fix spaciing * "cleaned up depth_of_tree" * Add doctests and then streamline display() and is_full_binary_tree() * added static typing to lazy_segment_tree.py * added missing import statement * modified variable names for left and right elements * added static typing to lowest_common_ancestor.py * fixed formatting * modified files to meet style guidelines, edited docstrings and added some doctests * added and fixed doctests in lazy_segment_tree.py * fixed errors in doctests Co-authored-by: Christian Clauss <cclauss@me.com>		2020-08-21 06:54:34 +02:00
..
binary_tree	lowest_common_ancestor.py static type checking (#2329)	2020-08-21 06:54:34 +02:00
disjoint_set	Add disjoint set (#1194)	2019-09-23 05:08:20 +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	Created Dijkstra's Two Stack Algorithm (#2321)	2020-08-20 17:49:43 +02:00
trie	Set the Python file maximum line length to 88 characters (#2122)	2020-06-16 10:09:19 +02:00