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

Fix

Browse Source
This commit is contained in:
Hardik Pawar 2024-10-03 11:37:38 +05:30
parent 6211693833
commit 5556acb7f8
1 changed files with 9 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
data_structures/linked_list/merge_sort_linked_list.py
View File

@ -20,7 +20,7 @@ class Node:
self.next: Node | None = None 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. Find the middle node of the linked list using the slow and fast pointer technique.
@ -28,17 +28,20 @@ def get_middle(head: Node) -> Node:
head: The head node of the linked list. head: The head node of the linked list.
Returns: Returns:
The middle node of the linked list. The middle node of the linked list, or None if the list is empty.
Example: Example:
>>> head = Node(1) >>> head = Node(1)
>>> head.next = Node(2) >>> head.next = Node(2)
>>> head.next.next = Node(3) >>> head.next.next = Node(3)
>>> get_middle(head).data >>> middle = get_middle(head)
>>> middle.data if middle else None
2 2
>>> get_middle(None) is None
True
""" """
if head is None: if head is None or head.next is None:
return head return head
slow = head # one node at a time slow = head # one node at a time
@ -153,6 +156,8 @@ def merge_sort_linked_list(head: Node | None) -> Node | None:
# Split the linked list into two halves # Split the linked list into two halves
middle = get_middle(head) middle = get_middle(head)
if middle is None:
return head
next_to_middle = middle.next next_to_middle = middle.next
middle.next = None # Split the list into two parts middle.next = None # Split the list into two parts