手写一个单链表 C#

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

namespace ConsoleApp1.链表
{
    public class Node<T>
    {
        /// <summary>
        /// 值
        /// </summary>
        public T Value { get; set; }
        /// <summary>
        /// 指向的下一节点
        /// </summary>
        public Node<T> nextNode { get; set; }


    }
}

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

namespace ConsoleApp1.链表
{
    public class LinkedList<T> : IEnumerable<T>
    {
        /// <summary>
        /// 起始节点
        /// </summary>
        private Node<T> firstNode { get; set; }

        //修改
        public void Update(T oldValue, T newValue)
        {
            Find(oldValue).Value = newValue;
        }
        //添加节点
        public void Add(T value)
        {
            if (firstNode == null)
            {
                firstNode = new Node<T> { Value = value };
                return;
            }
            Node<T> current = firstNode;
            while (current.nextNode != null)
            {
                current = current.nextNode;
            }
            current.nextNode = new Node<T> { Value = value };
        }

        //清除链表
        public void Clear()
        {
            firstNode = null;
        }

        //删除链表
        public void Remove(T value)
        {
            if (firstNode.Value.Equals(value))
            {
                firstNode = firstNode.nextNode;
                return;
            }
            Node<T> current = firstNode;
            while (current.nextNode != null)
            {
                var temp = current.nextNode;
                if (temp.Value.Equals(value))
                {
                    current.nextNode = temp.nextNode ?? null;
                    break;
                }
                current = current.nextNode;
            }
        }

        //查找节点
        public Node<T> Find(T value)
        {
            Node<T> current = firstNode;
            while (current != null)
            {
                if (current.Value.Equals(value))
                {
                    return current;
                }
                current = current.nextNode;
            }
            return null;
        }
        //遍历所有节点
        public IEnumerator GetEnumerator()
        {
            Node<T> current = firstNode;
            while (current != null)
            {
                yield return current;
                current = current.nextNode;
            }
        }
        IEnumerator<T> IEnumerable<T>.GetEnumerator()
        {
            yield return (T)GetEnumerator();
        }

    }
}