algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 17:34:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] pre-commit autoupdate (#11473)

Browse Source 
* [pre-commit.ci] pre-commit autoupdate

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.4.10 → v0.5.0](https://github.com/astral-sh/ruff-pre-commit/compare/v0.4.10...v0.5.0)
- [github.com/pre-commit/mirrors-mypy: v1.10.0 → v1.10.1](https://github.com/pre-commit/mirrors-mypy/compare/v1.10.0...v1.10.1)

* Fix ruff issues

* Fix ruff issues

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
pre-commit-ci[bot]
2024-07-02 07:02:29 +02:00
committed by GitHub
parent 6882a8b808
commit 716bdeb68b
32 changed files with 44 additions and 85 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
searches/binary_tree_traversal.py
View File

@ -36,7 +36,7 @@ def build_tree() -> TreeNode:
right_node = TreeNode(int(check))
node_found.right = right_node
q.put(right_node)
raise
raise ValueError("Something went wrong")
def pre_order(node: TreeNode) -> None:
@ -164,8 +164,8 @@ def level_order_actual(node: TreeNode) -> None:
if node_dequeued.right:
list_.append(node_dequeued.right)
print()
for node in list_:
q.put(node)
for inner_node in list_:
q.put(inner_node)
# iteration version