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

imrpoved del_node func(4)

Browse Source
This commit is contained in:
Shaurya Bisht 2024-10-13 09:54:44 +00:00
parent f4c580027b
commit c7c6efed9a
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/binary_tree/avl_tree.py
View File

@ -10,7 +10,7 @@ from __future__ import annotations
import math
import random
from typing import Any
from typing import Any, Optional
class MyQueue:
@ -208,7 +208,7 @@ def get_min_value_node(node: MyNode) -> MyNode:
return current
def del_node(root: MyNode, data: Any) -> MyNode | None:
def del_node(root: Optional[MyNode], data: Any) -> Optional[MyNode]:
if root is None:
print("Nothing to delete")
return None
@ -358,4 +358,4 @@ if __name__ == "__main__":
random.shuffle(lst)
for i in lst:
t.del_node(i)
print(str(t))
print(str(t))