Find the point of merging lists

In the task, you need to find the point of merging of simply connected lists and display the value in this node. I made it very simple: if the lists are of different lengths, I calculate the difference of their lengths, this is the number of redundant elements. I skip the extra elements and start moving along the two lists at the same time until a common point is found.

Is it possible to solve the problem by inverting lists? I on a piece of paper drew various variants of inverting one list or two at once, considered a variant of passage from the end, but nothing came to mind.

Is there any segolts in my code?

/* Find merge point of two linked lists Node is defined as struct Node { int data; Node* next; } */ // Подсчет количества элементов в списке int count(Node *head) { int c = 0; while(head) { c++; head = head->next; } return c; } int FindMergeNode(Node *headA, Node *headB) { if(headA && headB) // Если один из списков не пуст { int len_a = count(headA); // Вычисление длин списков A и B int len_b = count(headB); int diff = std::abs(len_a - len_b); // Разность между длинами списков for(int i = 0; i < diff; i++) // Пропуск лишних элементов в самом длинном списке (len_a > len_b) ? headA = headA->next : headB = headB->next; while(headA != NULL && headB != NULL) { if(headA == headB) // Если найдена точка слияния (адреса нод равны) return headA->data; headA = headA->next; headB = headB->next; } } return 0xDEADBEEF; }