mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-05-22 00:43:22 +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-14 12:32:49 +00:00
parent 6cd0cd31fe
commit 7654b0b9ed
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

@ -228,7 +228,7 @@ def del_node(root: MyNode | None, data: Any) -> MyNode | None:
elif root.get_right() is None: elif root.get_right() is None:
return root.get_left() return root.get_left()
right_child = root.get_right() right_child = root.get_right()
assert right_child is not None assert right_child is not None
temp = get_min_value_node(right_child) temp = get_min_value_node(right_child)
root.set_data(temp.get_data()) root.set_data(temp.get_data())
root.set_right(del_node(root.get_right(), temp.get_data())) root.set_right(del_node(root.get_right(), temp.get_data()))
@ -257,6 +257,7 @@ def del_node(root: MyNode | None, data: Any) -> MyNode | None:
return root return root
class AVLtree: class AVLtree:
""" """
An AVL tree doctest An AVL tree doctest
@ -361,4 +362,4 @@ if __name__ == "__main__":
random.shuffle(lst) random.shuffle(lst)
for i in lst: for i in lst:
t.del_node(i) t.del_node(i)
print(str(t)) print(str(t))