Question

I was working on a singularly-linked list. While creating my own linked list I got confused on printing the collection of nodes in my custom linked list.

I want to know, does a singularly-linked list display its collection in a LIFO manner like a stack?

below is my Own LinkedList AND node is A Class can anyone tell me Does Singular LinkedList Prints The Collection In Lifo Manner.

class MYlinklist
{
    Node header;

    public void Add(int a)
    {
        Node n = new Node();
        n.element = a;
        n.Next = header;
        header = n;
    }

    public void Print()
    {
        Node n = new Node();
        n = header;
        while (n != null)
        {
            Console.WriteLine(n.element.ToString());
            n = n.Next;
        }
    }
}

Answer 1

If you are referring to LinkedList<T>, the answer depends on how you add new members.

If you want to make the linked list iterate in LIFO, you can do so by always using AddFirst to add, and RemoveFirst to remove. This will cause it behave very much like a stack.

The nice thing about LinkedList<T>, however, is that you can add anywhere inside of the list as an O(1) operation.

---

Edit:

If you want this to be FIFO instead, you’ll need to change how to add your nodes, and add them at the end of the list, not the start:

class MyLinkedList
{
    Node header;
    Node last;

    public void Add(int a) 
    { 
        Node n = new Node(); 
        n.element = a; 
        n.Next = null; // We'll put this at the end...
        if (last == null)
        { 
            header = n;
            last = n;
        }
        else
        {
             last.Next = n;
             last = n;
        }
    } 

    public void Print() 
    { 
        Node n = new Node(); 
        n = header; 
        while (n != null) 
        { 
            Console.WriteLine(n.element.ToString()); 
            n = n.Next; 
        } 
    } 
}