Given a list , reorder it to Example: becomes . This problem combines three techniques you've learned:
Find the middle of the list
Reverse the second half
Merge the two halves alternately It's a great test of whether you can combine basic building blocks. Constraints: up to nodes, values from to .