Python/data_structures
Himanshu Bhatnagar b212a59754 Create deque_doubly.py (#1652)
* Create deque_doubly.py

Implementing Deque ADT using Doubly Linked List....

* Update deque_doubly.py

* Update deque_doubly.py

Adding doctest

* Update doctest of deque_doubly.py

* Update deque_doubly.py

* linked_list.

Co-authored-by: Christian Clauss <cclauss@me.com>
2020-01-05 10:51:03 +01:00
..
binary_tree pyupgrade --py37-plus **/*.py (#1654) 2020-01-03 22:25:36 +08:00
data_structures/heap pyupgrade --py37-plus **/*.py (#1654) 2020-01-03 22:25:36 +08:00
disjoint_set Add disjoint set (#1194) 2019-09-23 05:08:20 +02:00
hashing pyupgrade --py37-plus **/*.py (#1654) 2020-01-03 22:25:36 +08:00
heap GitHub Action formats our code with psf/black (#1569) 2019-11-14 19:59:43 +01:00
linked_list Create deque_doubly.py (#1652) 2020-01-05 10:51:03 +01:00
queue Tabs --> spaces in quine_mc_cluskey.py (#1426) 2019-11-21 22:21:40 +08:00
stacks pyupgrade --py37-plus **/*.py (#1654) 2020-01-03 22:25:36 +08:00
trie Add delete to trie.py + tests (#1177) 2019-09-13 22:24:25 +02:00