是否可以将二进制搜索应用于链接列表以查找元素？

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

def binary_search_linked_list(head: ListNode, target: int) -> ListNode:
    if head is None:
        return None

    # 计算链表长度
    length = 0
    current = head
    while current:
        length += 1
        current = current.next

    # 二进制搜索
    left, right = 0, length - 1
    while left <= right:
        mid = (left + right) // 2
        mid_node = get_node(head, mid)

        if mid_node.val == target:
            return mid_node
        elif mid_node.val< target:
            left = mid + 1
        else:
            right = mid - 1

    return None

def get_node(head: ListNode, index: int) -> ListNode:
    current = head
    for _ in range(index):
        current = current.next
    return current