C# 单向链表 逆序（递归）

  static void Main(string[] args)
        {
            while (true)
            {
                LinkedList L = new LinkedList();
                L.Add(new Node("first"));
                L.Add(new Node("second"));
                L.Add(new Node("third"));
                L.Add(new Node("forth"));
                Cw(L.Head);
                L.Head= Reverse(L.Head);
                Cw(L.Head);
                Console.ReadKey();
                i = 1;
            }

        }

        private static int i = 1;


        //单向链表逆序
        private static Node Reverse(Node header)
        {
            if (header.Next == null)
            {
                return header;
            }
            //找到最后一个
            var node = Reverse(header.Next);
            //后一个的指针 指向前一个
            header.Next.Next = header;
            //前一个指针置空
            header.Next = null;
            return node;
        }

        //单向链表输出
        private static void Cw(Node node)
        {
            Console.WriteLine(node.Data);
            if (node.Next != null)
            {
                Cw(node.Next);
            }
        }

        public class Node
        {
            public object Data;
            public Node Next;
            public Node(object Data)
            {
                this.Data = Data;
            }
        }

        public class LinkedList
        {
            public Node Head;
            public Node Tail;
            public void Add(Node n)
            {
                if (Head == null)
                {
                    Head = n;
                    Tail = Head;
                }
                else
                {
                    Tail.Next = n;
                    Tail = Tail.Next;
                }
            }
        }