mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-17 14:58:10 +00:00
Code Issues Packages Projects Releases Wiki Activity

[pre-commit.ci] auto fixes from pre-commit.com hooks

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-10-12 13:36:43 +00:00
parent 672cb3bbd9
commit c91f6b6359
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
data_structures/binary_tree/avl_tree.py
View File

@ -195,7 +195,6 @@ def get_left_most(root: MyNode) -> Any:
return root.get_data()
def del_node(root: MyNode, data: Any) -> MyNode | None:
if root is None:
print("Node is empty, nothing to delete")
@ -229,7 +228,9 @@ def del_node(root: MyNode, data: Any) -> MyNode | None:
root.set_right(del_node(right_child, data))
# Update the height of the node
root.set_height(1 + my_max(get_height(root.get_left()), get_height(root.get_right())))
root.set_height(
1 + my_max(get_height(root.get_left()), get_height(root.get_right()))
)
# Get the balance factor
balance_factor = get_height(root.get_right()) - get_height(root.get_left())