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

enhanced del_node function

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 09:37:24 +00:00
parent 31b6a0846a
commit 6a7914073d
1 changed files with 14 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
data_structures/binary_tree/avl_tree.py
View File

@ -195,61 +195,54 @@ def get_left_most(root: MyNode) -> Any:
return root.get_data()
# Function to get balance factor
def get_balance(node: MyNode) -> int:
if node is None:
return 0
return get_height(node.get_left()) - get_height(node.get_right())
def get_min_value_node(node: MyNode) -> MyNode:
current = node
while current.get_left() is not None:
current = current.get_left()
return current
def del_node(root: MyNode, data: Any) -> MyNode | None:
if root is None:
print("Nothing to delete")
return None
if root.get_data() > data:
root.set_left(del_node(root.get_left(), data))
elif root.get_data() < 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:
# Node to delete found
if root.get_left() is None:
return root.get_right()
elif root.get_right() is None:
return root.get_left()
else:
# Node with two children
temp = get_min_value_node(root.get_right())
root.set_data(temp.get_data())
root.set_right(del_node(root.get_right(), temp.get_data()))
# Node with two children
temp = get_min_value_node(root.get_right())
root.set_data(temp.get_data())
root.set_right(del_node(root.get_right(), temp.get_data()))
root.set_height(
1 + my_max(get_height(root.get_left()), get_height(root.get_right()))
)
root.set_height(1 + my_max(get_height(root.get_left()), get_height(root.get_right())))
balance = get_balance(root)
# Left Left
# Left Left Case
if balance > 1 and get_balance(root.get_left()) >= 0:
return right_rotation(root)
# Left Right
# Left Right Case
if balance > 1 and get_balance(root.get_left()) < 0:
root.set_left(left_rotation(root.get_left()))
return right_rotation(root)
# Right Right
# Right Right Case
if balance < -1 and get_balance(root.get_right()) <= 0:
return left_rotation(root)
# Right Left
# Right Left Case
if balance < -1 and get_balance(root.get_right()) > 0:
root.set_right(right_rotation(root.get_right()))
return left_rotation(root)