# Intersection of Two Linked Lists

Write a program to find the node at which the intersection of two singly linked lists begins. If the two linked lists have no intersection at all, return null. The linked lists must retain their original structure after the function returns. You may assume there are no cycles anywhere in the entire linked structure.

Example

```
A: a1 → a2
↘
c1 → c2 → c3
↗
B: b1 → b2 → b3
For lists A and B, the intersection begins at node c1.
```

The following implements insertion sort.