Python/data_structures
KirilBangachev f31a812c46 Add Binomial Heap (#1146)
* Binomial Heap

Implementation of Binomial Heap. Reference: Advanced Data Structures, Peter Brass

* Update binomial_heap.py

* Update binomial_heap.py

* Update binomial_heap.py

- Fuller documentation of binomial heap
- Update unit tests
- Replace printing method by overwriting __str__()

* Update binomial_heap.py

- Added more tests
- Added to the documentation
- Stylistic editing
- mergeHeaps now also returns a reference to the merged heap
- added a preOrder function that returns a list with the preorder of the heap

* Update binomial_heap.py

Changed the unit tests structure

* Turned the tests into doctests
2019-09-05 07:58:37 +02:00
..
binary_tree Simplify code by dropping support for legacy Python (#1143) 2019-08-19 15:37:49 +02:00
hashing Added doctest and more explanation about Dijkstra execution. (#1014) 2019-07-17 01:09:53 +02:00
heap Add Binomial Heap (#1146) 2019-09-05 07:58:37 +02:00
linked_list Simplify code by dropping support for legacy Python (#1143) 2019-08-19 15:37:49 +02:00
queue Simplify code by dropping support for legacy Python (#1143) 2019-08-19 15:37:49 +02:00
stacks Simplify code by dropping support for legacy Python (#1143) 2019-08-19 15:37:49 +02:00
trie snake_case all the things 2018-10-19 17:14:25 -05:00