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

imrpoved del_node func (13)

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 11:35:17 +00:00
parent bb85f44341
commit e949959eff
1 changed files with 2 additions and 3 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

@ -201,7 +201,7 @@ def get_balance(node: MyNode | None) -> int:
return get_height(node.get_left()) - get_height(node.get_right()) return get_height(node.get_left()) - get_height(node.get_right())
def get_min_value_node(node: MyNode) -> MyNode: def get_min_value_node(node: MyNode | None) -> MyNode | None:
if node is None: if node is None:
return None return None
current_node = node current_node = node
@ -209,7 +209,6 @@ def get_min_value_node(node: MyNode) -> MyNode:
current_node = current_node.get_left() current_node = current_node.get_left()
return current_node return current_node
def del_node(root: MyNode | None, data: Any) -> MyNode | None: def del_node(root: MyNode | None, data: Any) -> MyNode | None:
if root is None: if root is None:
print("Nothing to delete") print("Nothing to delete")
@ -370,4 +369,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))