mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-19 00:37:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix type hint

Browse Source
This commit is contained in:
Hardik Pawar 2024-10-03 11:33:17 +05:30
parent 42a1f27126
commit b3304eb0fd
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
data_structures/linked_list/merge_sort_linked_list.py
View File

@ -20,7 +20,7 @@ class Node:
self.next: Node | None = None
def get_middle(head: Node) -> Node:
def get_middle(head: Node | None) -> Node | None:
"""
Find the middle node of the linked list using the slow and fast pointer technique.