bool compare_lists(SinglyLinkedListNode* head1, SinglyLinkedListNode* head2) {
    if (head1->data != head2->data) return false;
    if (head1->next == nullptr && head2->next == nullptr) return true;
    if (head1->next == nullptr || head2->next == nullptr) return false;
    return compare_lists(head1->next, head2->next);
}

def compare_lists(llist1, llist2):
    while llist1 and llist2:
        if llist1.data != llist2.data:
            return 0
        llist1 = llist1.next
        llist2 = llist2.next
    return 1 if llist1 is None and llist2 is None else 0

static boolean compareLists(SinglyLinkedListNode head1, SinglyLinkedListNode head2) {
        if(head1 == null && head2 == null) return true;
        
        while(head1 != null && head2 != null){
            if(head1.data != head2.data) return false;
             
             head1 = head1.next;
             head2 = head2.next;
        }
        return head1 == head2;
    }

def compare_lists(llist1: SinglyLinkedListNode, llist2: SinglyLinkedListNode) -> bool:
    """Iteratively check two linked lists for equality."""
    while llist1 and llist2 and llist1.data == llist2.data:
        llist1 = llist1.next
        llist2 = llist2.next
    return llist1 is None and llist2 is None


def compare_lists(llist1: SinglyLinkedListNode, llist2: SinglyLinkedListNode) -> bool:
    """Recursively check two linked lists for equality."""
    match llist1 is None, llist2 is None:
        case False, False:
            return (
                compare_lists(llist1.next, llist2.next)
                if llist1.data == llist2.data
                else False
            )
        case True, True:
            return True
        case _:
            return False

bool compare_lists(SinglyLinkedListNode* head1, SinglyLinkedListNode* head2) {
    while(head1 != nullptr && head2 !=nullptr) {
        if(head1->data != head2->data) return false;
        head1 = head1 ->next;
        head2 = head2 ->next;
    }
    return head2 == head1;
}