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

improved del_node func(5)

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 10:03:00 +00:00
parent 64822ac0d3
commit ab084df119
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
data_structures/binary_tree/avl_tree.py
View File

@ -208,7 +208,7 @@ def get_min_value_node(node: MyNode) -> MyNode:
return current return current
def del_node(root: Optional[MyNode], data: Any) -> Optional[MyNode]: 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")
return None return None
@ -358,4 +358,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))