So I\'m visiting each node and storing the val recursively. Once I reach the end, I set the val to the first val, go back set it to second val etc. Is this a vaild solution, or do I need to actually change the node.next values?\n\n```\n        vals = []\n        def aux(node):\n            if not node:\n                return\n            else:\n                vals.append(node.val)\n                aux(node.next)\n                node.val = vals[0]\n                vals.pop(0)\n        aux(head)\n        return head\n```

So I\'m visiting each node and storing the val recursively. Once I reach the end, I set the val to the first val, go back set it to second val etc. Is this a va