Implementation of queue using linked list in c#.net

Question

Hi I want to implement a queue using linked list in c#.net. This queue will hold PdfDocument and WordDocument object. B ut I don't want to use standard container which are available in c#. I want to implement it by pure data structure. This queue should have two functions 1) PUSH() which will insert document in queue and 2) POP() will retrive the document from the queue. If any body any idea please share with me. It will be highly appreciated… Thanks & Regards Nabhendu

Vulpes · Answer

Here's an implementation of a generic Queue class using a linked list. It can be a queue of anything - I've used strings for illustration. Notice that linked lists are not very efficient in .NET (except possibly for inserting nodes at random positions) and so it won't work as quickly as the .NET implementation of Queue which uses an array for its internal storage: using System; using System.Collections.Generic; class Test { static void Main() { Queue q = new Queue (); q.Push(C#); q.Push(Corner); Console.WriteLine(q.Pop()); // C# Console.WriteLine(q.Pop()); // Corner Console.WriteLine(q.Pop()); // null Console.ReadKey(); } } public class Queue { private LinkedList list = new LinkedList (); public T Pop() { if (list.Count > 0) { LinkedListNode first = list.First; list.RemoveFirst(); return first.Value; } else { return default(T); // or throw an exception } } public void Push(T item) { list.AddLast(item); // EDIT: sorry had AddFirst here to start with! } }