doubly linked list corruption

def solution(head, tail):
    """
    inputs: head and tail node
    outputs: True - if there's no corruption, False - corruption exists

    """
    if head.prev!=None or tail.next!=None:
        return False

    while head.next:
        if head!=head.next.prev:
            return False
        head = head.next
    return True