#1: We have a linked list, but it is special in that it can have pointers down, as well as next. Any node can have an arbitrary number of links down as well as across. Write a function that will "flatten" this linked list so that it does not have any down pointers, but all elements remain in order.
