mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-08 06:45:54 +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-13 08:48:54 +00:00
parent 20aed9e68d
commit 31b6a0846a
1 changed files with 8 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
data_structures/binary_tree/avl_tree.py
View File

@ -194,23 +194,26 @@ def get_left_most(root: MyNode) -> Any:
root = left_child
return root.get_data()
# Function to get balance factor
def get_balance(node: MyNode) -> int:
if node is None:
return 0
return get_height(node.get_left()) - get_height(node.get_right())
def get_min_value_node(node: MyNode) -> MyNode:
current = node
while current.get_left() is not None:
current = current.get_left()
return current
def del_node(root: MyNode, data: Any) -> MyNode | None:
if root is None:
print("Nothing to delete")
return None
if root.get_data() > data:
root.set_left(del_node(root.get_left(), data))
elif root.get_data() < data:
@ -227,7 +230,9 @@ def del_node(root: MyNode, data: Any) -> MyNode | None:
root.set_data(temp.get_data())
root.set_right(del_node(root.get_right(), temp.get_data()))
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()))
)
balance = get_balance(root)
@ -251,6 +256,7 @@ def del_node(root: MyNode, data: Any) -> MyNode | None:
return root
class AVLtree:
"""
An AVL tree doctest