在Java中展平链接列表

I am trying to flatten a multi level linked list. Given a linked list where every node represents a linked list and contains two pointers of its type: (i) Pointer to next node in the main list (we call it ‘right’ pointer in below code) (ii) Pointer to a linked list where this node is head (we call it ‘down’ pointer in below code). All linked lists are sortedI am trying to flatten a multi level linked lis