各位大侠们好！
   鄙人最近刚刚自学C#一段时间，但是还不知道像C中的链表能在C#中实现不？
   如果能，该如何实现？
   如果不能，那像往有序序列中插入数据的效率岂不很低？
  谢谢！！

namespace ConsoleApplication15
{
    class Program
    {
        static void Main(string[] args)
        {
            unsafe
            {
                int* x;
                int y = 10;
                x = &y;
                Console.Write(*x);
                Console.ReadLine();
            }
        }
    }
}

我只能在这告诉你可以在C#中用指针


[[it] 本帖最后由 ioriliao 于 2008-4-12 08:50 编辑 [/it]]

可以啊
using System;
using System.Collections.Generic;
using System.Text;

namespace ConsoleApplication
{
    class Node<T>
    {
        public T data;
        public Node<T> next;
        public Node()
        {
            this.data = default(T);
            this.next = null;
        }
        public Node(T t)
        {
            this.data = t;
            this.next = null;
        }
    }
}
－－－－－－－－－－－－－－－－－－－－
using System;
using System.Collections.Generic;
using System.Text;

namespace ConsoleApplication
{
    class LinkList<T>
    {
        private Node<T> hNode;
        private Node<T> tmpNode;
        public LinkList()
        {
            this.hNode = new Node<T>();
        }
        public void AddItem(T t)
        {

                this.tmpNode = this.hNode;
                while (this.tmpNode.next != null)
                {
                    this.tmpNode = this.tmpNode.next;
                }
                this.tmpNode.next = new Node<T>(t);
        }
        public void LinkItem()
        {
            this.tmpNode = this.hNode;
            while (this.tmpNode.next != null)
            {
                 this.tmpNode = this.tmpNode.next;
            }
            this.tmpNode.next = this.hNode.next;
        }
        public bool IsCycle()
        {
            Node<T> n1;
            Node<T> n2;
            n1 = hNode;
            n2 = hNode;
            do
            {
                n2 = n2.next;
                n1 = n1.next.next;
                if (n1 == null)
                {
                    return false;
                }
               
            } while (!n1.Equals(n2));
            return true;
        }
        public void Show()
        {
            Node<T> n;
            n = hNode;
            while (n.next != null)
            {
                Console.WriteLine(n.data);
                n = n.next;
            }
        }
        public T this[int index]
        {
            get
            {
                this.tmpNode = this.hNode;
                while((index--)!=0)
                {
                    this.tmpNode = this.tmpNode.next;
                }
                return this.tmpNode.data;
            }
        }
    }
}

知道吗？我感动的鼻涕都快流出来了！！
   真是太感谢了！！