Reverse a Linked List Using Recursion

Problem

Given a linked list, reverse the nodes in the list.
Example input:
1->2->3->4->5
Example output:
5->4->3->2->1

Solution

This solution is in C#. Our A.I. can create solutions in multiple languages.

kayakane

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApplication1
{
    class Program
    {
        static void Main(string[] args)
        {
            LinkedList<int> list = new LinkedList<int>();
            list.AddLast(1);
            list.AddLast(2);
            list.AddLast(3);
            list.AddLast(4);
            list.AddLast(5);

            LinkedList<int> reversedList = ReverseLinkedList(list);

            foreach (int i in reversedList)
            {
                Console.WriteLine(i);
            }
        }

        public static LinkedList<int> ReverseLinkedList(LinkedList<int> list)
        {
            LinkedList<int> reversedList = new LinkedList<int>();

            foreach (int i in list)
            {
                reversedList.AddFirst(i);
            }

            return reversedList; }
    }
}