Python/data_structures
kanthuc ecac7b0973
Contains loops.py add (#2442)
* added an algorithm which checks a linked list for loops and returns true if one is found

* added doctests and clarified meaning of loop

* Define Node.__iter__()

* Update and rename has_loop.py to has_duplicate_data.py

* Update has_duplicate_data.py

* Update has_duplicate_data.py

* Update and rename has_duplicate_data.py to has_loop.py

* Update has_loop.py

Co-authored-by: Christian Clauss <cclauss@me.com>
2020-09-18 22:53:50 +02:00
..
binary_tree Optimized recursive_bubble_sort (#2410) 2020-09-10 10:31:26 +02:00
disjoint_set Create alternate_disjoint_set.py (#2302) 2020-08-28 18:25:02 +02:00
hashing Optimized recursive_bubble_sort (#2410) 2020-09-10 10:31:26 +02:00
heap removed redundant data_structures folder (#2256) 2020-07-31 20:36:02 +02:00
linked_list Contains loops.py add (#2442) 2020-09-18 22:53:50 +02:00
queue Create priority_queue_using_list.py (#2435) 2020-09-16 18:42:53 +02:00
stacks Updated Stack (#2414) 2020-09-13 13:56:03 +02:00
trie Set the Python file maximum line length to 88 characters (#2122) 2020-06-16 10:09:19 +02:00