From b3304eb0fdf8f07ff01d2b9d80cd5b351ff0301d Mon Sep 17 00:00:00 2001
From: Hardik Pawar <hardikhpawar.cs21@rvce.edu.in>
Date: Thu, 3 Oct 2024 11:33:17 +0530
Subject: [PATCH] Fix type hint

---
 data_structures/linked_list/merge_sort_linked_list.py | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/data_structures/linked_list/merge_sort_linked_list.py b/data_structures/linked_list/merge_sort_linked_list.py
index 844bbae90..7e93b63a4 100644
--- a/data_structures/linked_list/merge_sort_linked_list.py
+++ b/data_structures/linked_list/merge_sort_linked_list.py
@@ -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.