mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-30 22:23:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

fixed error in del_node function

Browse Source
This commit is contained in:
Rachel 2024-08-06 14:49:05 -07:00
parent ed1900f1b3
commit 2d2c6d93b2
1 changed files with 4 additions and 1 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

@ -215,12 +215,15 @@ def del_node(root: MyNode, data: Any) -> MyNode | None:
return root return root
else: else:
root.set_left(del_node(left_child, data)) root.set_left(del_node(left_child, data))
# root.get_data() < data
elif right_child is None: elif right_child is None:
return root return root
else: else:
root.set_right(del_node(right_child, data)) root.set_right(del_node(right_child, data))
# Re-fetch left_child and right_child references
left_child = root.get_left()
right_child = root.get_right()
if get_height(right_child) - get_height(left_child) == 2: if get_height(right_child) - get_height(left_child) == 2:
assert right_child is not None assert right_child is not None
if get_height(right_child.get_right()) > get_height(right_child.get_left()): if get_height(right_child.get_right()) > get_height(right_child.get_left()):