How does recursion work in this “flatten doubly linked list” code?

Question

The problem is from leetcode #430 Flatten a Multilevel doubly Linked List. So basically, each node has three fields: next, prev, and child. And the problem asks to flatten t