Joan Martin Miralles
a38e143cf8
Binary search tree using recursion ( #1839 )
...
* Binary search tree using recursion
* updating DIRECTORY.md
Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
2020-04-07 18:09:05 +02:00
Prince Gangurde
6043a44ffb
Update basic_binary_tree.py ( #1833 )
...
fixed some grammar mistakes
2020-04-07 00:59:32 +02:00
matkosoric
7f04e5cd34
contribution guidelines checks ( #1787 )
...
* spelling corrections
* review
* improved documentation, removed redundant variables, added testing
* added type hint
* camel case to snake case
* spelling fix
* review
* python --> Python # it is a brand name, not a snake
* explicit cast to int
* spaces in int list
* "!= None" to "is not None"
* Update comb_sort.py
* various spelling corrections in documentation & several variables naming conventions fix
* + char in file name
* import dependency - bug fix
Co-authored-by: John Law <johnlaw.po@gmail.com>
2020-03-04 13:40:28 +01:00
onlinejudge95
4866b1330b
Fixes black failures from Previous PR ( #1751 )
...
* Fixes black failures from Previous PR
* Fixes equality testing alert
* Fixes call to main() alert
* Fixes unused import
2020-02-13 02:19:41 +05:30
onlinejudge95
7b7c1a0135
Fixes unused variable errors in LGTM ( #1746 )
...
* Fixes unsed variable errors in LGTM
* Fixes integer check
* Fixes failing tests
2020-02-11 13:59:09 +05:30
Christian Clauss
bfcb95b297
Create codespell.yml ( #1698 )
...
* fixup! Format Python code with psf/black push
* Create codespell.yml
* fixup! Format Python code with psf/black push
2020-01-18 13:24:33 +01:00
Christian Clauss
e849578e59
Update and rename lca.py to lowest_common_ancestor.py ( #1664 )
...
* Update and rename lca.py to lowest_common_ancestor.py
* fixup! Format Python code with psf/black push
2020-01-08 21:15:41 +08:00
MadhavCode
46df735cf4
New Code!!(Finding the N Possible Binary Search Tree and Binary Tree from Given N node Number) ( #1663 )
...
* Code Upload
* Code Upload
* Delete n_possible_bst
* Find the N Possible Binary Tree and Binary Tree from given Nth Number of Node.
* Update in Test
* Update and rename n_possible_bst.py to number_of_possible_binary_trees.py
Co-authored-by: Christian Clauss <cclauss@me.com>
2020-01-07 10:17:35 +01:00
Christian Clauss
28419cf839
pyupgrade --py37-plus **/*.py ( #1654 )
...
* pyupgrade --py37-plus **/*.py
* fixup! Format Python code with psf/black push
2020-01-03 22:25:36 +08:00
Christian Clauss
34c808b375
actions/checkout@v2 ( #1643 )
...
* actions/checkout@v2
https://github.com/actions/checkout/releases
* fixup! Format Python code with psf/black push
2019-12-26 19:50:12 +08:00
Hocnonsense
81ae5adcc8
Update binary_search_tree.py ( #1339 )
...
* Update binary_search_tree.py
remove some bugs
* Update binary_search_tree.py
* Update binary_search_tree.py
* Update binary_search_tree.py
* Update binary_search_tree.py
* Update binary_search_tree.py
* Update binary_search_tree.py
* testlist = (8, 3, 6, 1, 10, 14, 13, 4, 7)
* Update .travis.yml
Co-authored-by: Christian Clauss <cclauss@me.com>
2019-12-21 01:44:31 +01:00
Christian Clauss
5df8aec66c
GitHub Action formats our code with psf/black ( #1569 )
...
* GitHub Action formats our code with psf/black
@poyea Your review please.
* fixup! Format Python code with psf/black push
2019-11-14 19:59:43 +01:00
Jonathan Alberth Quispe Fuentes
7bc0462e79
Non-recursive Segment Tree implementation ( #1543 )
...
* Non-recursive Segment Tree implementation
* Added type hints and explanations links
2019-11-01 04:00:46 +01:00
Samarth Sehgal
a2a3ca674f
Update treap.py ( #1455 )
2019-10-25 17:56:27 +02:00
Ankur Chattopadhyay
7592cba417
psf/black code formatting ( #1421 )
...
* added sol3.py for problem_20
* added sol4.py for problem_06
* ran `black .` on `\Python`
2019-10-22 19:13:48 +02:00
Hocnonsense
179284a41b
Update treap.py ( #1358 )
...
* Update treap.py
check merge()
* Update treap.py
random() is used. its difficult to write doctests
l->left
r->right
key->value
add __repr__ and __str__ in preorder
2019-10-18 09:39:37 +02:00
Nishant-Ingle
06d736199b
Added comment ( #1294 )
2019-10-07 23:29:14 +05:00
William Zhang
9eac17a408
psf/black code formatting ( #1277 )
2019-10-05 10:14:13 +05:00
Christian Clauss
47a9ea2b0b
Simplify code by dropping support for legacy Python ( #1143 )
...
* Simplify code by dropping support for legacy Python
* sort() --> sorted()
2019-08-19 15:37:49 +02:00
Christian Clauss
89acf5d017
print() is a function just like every other function ( #1101 )
...
* print() is a function just like every other function
2019-08-06 12:14:23 +02:00
QuantumNovice
c27bd5144f
in_static_equilibrium checks if a 2D static system is in equilibrium ( #1062 )
...
* Add files via upload
* Add files via upload
* Create .a
* Add files via upload
* Add files via upload
* Rename static_solver.py to in_static_equilibrium.py
* Delete .a
* Update in_static_equilibrium.py
* Add files via upload
* Add files via upload
* Update in_static_equilibrium.py
* Add files via upload
* Add files via upload
* Add files via upload
* Add files via upload
* pyTests added
* Add files via upload
* Delete red_black_tree.py
* Add files via upload
2019-07-25 20:38:24 +02:00
Alfonso Rodríguez Pereira
5f991f7740
#315 Renamed all files to snake_case ( #993 )
2019-07-11 11:16:42 +02:00
Anup Kumar Panwar
4e413c0183
Updated README
2019-07-06 11:11:20 +05:30
Jarred Allen
506bb5ccfe
Add Red-Black Binary Search Trees ( #954 )
...
* Wrote most of an rbt, missing just removal
* Added some convenience methods.
* Added a color method
* Wrote code to delete, but has issues :(
* Fixed a bug in Red-Black trees
* Fixed bug in tree color validation and delete repairing
* Clean up == comparison to None
2019-07-05 14:13:16 +05:30
Hector S
05e5172093
.vs/ directory, matrix_multiplication_addition file and binary tree directory ( #894 )
...
* Added print function into matrix_multiplication_addition.py and removed blank space in data_structures/binary tree directory
* Removed .vs/ folder per #893
* Rename matrix_multiplication_addition.py to matrix_operation.py
2019-06-11 19:24:53 +08:00
