mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-06 13:55:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

improved del_node func(13)

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 12:22:40 +00:00
parent 4fc0c00b90
commit 9218a96cc7
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/binary_tree/avl_tree.py
View File

@ -227,8 +227,8 @@ def del_node(root: MyNode | None, data: Any) -> MyNode | None:
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)
if temp is not None:
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()))
root.set_height( root.set_height(
@ -370,4 +370,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))