如何使用快速排序对链表中的数据进行排序？

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

def quickSort(head):
    # 链表为空或只有一个节点，直接返回
    if not head or not head.next:
        return head
    
    # 选择基准元素
    pivot = head.val
    smaller_head = ListNode(0)
    smaller_tail = smaller_head
    equal_head = ListNode(0)
    equal_tail = equal_head
    larger_head = ListNode(0)
    larger_tail = larger_head
    
    # 分割链表
    curr = head
    while curr:
        if curr.val < pivot:
            smaller_tail.next = curr
            smaller_tail = smaller_tail.next
        elif curr.val == pivot:
            equal_tail.next = curr
            equal_tail = equal_tail.next
        else:
            larger_tail.next = curr
            larger_tail = larger_tail.next
        curr = curr.next
    
    # 递归排序子链表
    smaller_head = quickSort(smaller_head.next)
    larger_head = quickSort(larger_head.next)
    
    # 合并链表
    if smaller_head:
        smaller_tail.next = equal_head.next
        equal_tail.next = larger_head
        return smaller_head
    else:
        equal_tail.next = larger_head
        return equal_head.next