LeetCode #143: Reorder List

Author: WazedKhan

LeetCode/medium/reorder_list_143.py

@@ -8,14 +8,6 @@ def __init__(self, val=0, next=None):
 
 
 class Solution:
-
-    def print_linked_list(self, head):
-        current = head
-        while current is not None:
-            print(current.val, end="")
-            current = current.next
-        print()
-
     def reorderList(self, head: Optional[ListNode]) -> None:
         slow, fast = head, head