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

Improved del_node(8)

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 10:32:11 +00:00
parent 4f604e3811
commit 0622d4bbff
1 changed files with 29 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

51
data_structures/binary_tree/avl_tree.py
View File

@ -219,39 +219,46 @@ def del_node(root: MyNode | None, data: Any) -> MyNode | None:
root.set_left(del_node(root.get_left(), data)) root.set_left(del_node(root.get_left(), data))
elif root.get_data() < data: elif root.get_data() < data:
root.set_right(del_node(root.get_right(), data)) root.set_right(del_node(root.get_right(), data))
elif root.get_left() is None:
return root.get_right()
elif root.get_right() is None:
return root.get_left()
else: else:
# Node with two children if root.get_left() is None:
return root.get_right()
elif root.get_right() is None:
return root.get_left()
temp = get_min_value_node(root.get_right()) temp = get_min_value_node(root.get_right())
assert 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(1 + my_max(get_height(root.get_left()), get_height(root.get_right())))
1 + my_max(get_height(root.get_left()), get_height(root.get_right()))
)
balance = get_balance(root) balance = get_balance(root)
# Left Left Case if balance > 1:
if balance > 1 and get_balance(root.get_left()) >= 0: left_child = root.get_left()
return right_rotation(root) assert left_child is not None
if get_balance(left_child) >= 0:
return right_rotation(root)
# Left Right Case if balance > 1:
if balance > 1 and get_balance(root.get_left()) < 0: left_child = root.get_left()
root.set_left(left_rotation(root.get_left())) assert left_child is not None
return right_rotation(root) if get_balance(left_child) < 0:
root.set_left(left_rotation(left_child))
return right_rotation(root)
# Right Right Case if balance < -1:
if balance < -1 and get_balance(root.get_right()) <= 0: right_child = root.get_right()
return left_rotation(root) assert right_child is not None
if get_balance(right_child) <= 0:
return left_rotation(root)
# Right Left Case if balance < -1:
if balance < -1 and get_balance(root.get_right()) > 0: right_child = root.get_right()
root.set_right(right_rotation(root.get_right())) assert right_child is not None
return left_rotation(root) if get_balance(right_child) > 0:
root.set_right(right_rotation(right_child))
return left_rotation(root)
return root return root