We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 42a1f27 commit b3304ebCopy full SHA for b3304eb
1 file changed
data_structures/linked_list/merge_sort_linked_list.py
@@ -20,7 +20,7 @@ def __init__(self, data: int) -> None:
20
self.next: Node | None = None
21
22
23
-def get_middle(head: Node) -> Node:
+def get_middle(head: Node | None) -> Node | None:
24
"""
25
Find the middle node of the linked list using the slow and fast pointer technique.
26
0 commit comments