Skip to content

Fix Bugs and Improve Traversal Methods in Binary Search Tree Implementation #9535

Fix Bugs and Improve Traversal Methods in Binary Search Tree Implementation

Fix Bugs and Improve Traversal Methods in Binary Search Tree Implementation #9535

Triggered via pull request September 3, 2024 15:15
Status Failure
Total duration 18s
Artifacts

ruff.yml

on: pull_request
Fit to window
Zoom out
Zoom in

Annotations

4 errors
Ruff (PLR5501): data_structures/binary_tree/binary_search_tree.py#L189
data_structures/binary_tree/binary_search_tree.py:189:17: PLR5501 Use `elif` instead of `else` then `if`, to reduce indentation
Ruff (EM102): data_structures/binary_tree/binary_search_tree.py#L278
data_structures/binary_tree/binary_search_tree.py:278:30: EM102 Exception must not use an f-string literal, assign to variable first
Ruff (F841): data_structures/binary_tree/binary_search_tree.py#L341
data_structures/binary_tree/binary_search_tree.py:341:9: F841 Local variable `node_list` is assigned to but never used
ruff
Process completed with exit code 1.