mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-28 16:43:38 +00:00
Code Issues Packages Projects Releases Wiki Activity

improved del_node function(10)

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 10:57:08 +00:00
parent af5291dd82
commit 995a4d5607
1 changed files with 5 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
data_structures/binary_tree/avl_tree.py
View File

@ -225,8 +225,10 @@ def del_node(root: MyNode | None, data: Any) -> MyNode | None:
elif root.get_right() is None:
return root.get_left()
temp = get_min_value_node(root.get_right())
assert temp is not None
right_child = root.get_right()
assert right_child is not None # Ensure root.get_right() is not None
temp = get_min_value_node(right_child)
assert temp is not None # Ensure get_min_value_node doesn't return None
root.set_data(temp.get_data())
root.set_right(del_node(root.get_right(), temp.get_data()))
@ -369,4 +371,4 @@ if __name__ == "__main__":
random.shuffle(lst)
for i in lst:
t.del_node(i)
print(str(t))
print(str(t))