C# - Singly Linked List

I have given here C# sample code for singly linked list, filling elements and traversal in forward direction.

Singly Linked List, Doubly Linked List, Singly Linked Circular List and Doubly Linked Circular List are an important data structure used in C# applications.

Source Code

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace CSTest

{

class SLinkList

{

private int data;

private SLinkList next;

public SLinkList()

{

data = 0;

next = null;

}

public SLinkList(int value)

{

data = value;

next = null;

}

public SLinkList InsertNext(int value)

{

SLinkList node = new SLinkList(value);

if(this.next == null)

{

// Easy to handle

node.next = null; // already set in constructor

this.next = node;

}

else

{

// Insert in the middle

SLinkList temp = this.next;

node.next = temp;

this.next = node;

}

return node;

}

public int DeleteNext()

{

if(next == null)

return 0;

SLinkList node = this.next;

this.next = this.next.next; // can be NULL here

node = null;

return 1;

}

public void Traverse(SLinkList node)

{

if(node == null)

node = this;

System.Console.WriteLine("\n\nTraversing in Forward Direction\n\n");

while(node != null)

{

System.Console.WriteLine(node.data);

node = node.next;

}

class Program

{

static void Main(string[] args)

{

SLinkList node1 = new SLinkList(1);

SLinkList node2 = node1.InsertNext(2);

SLinkList node3 = node2.InsertNext(3);

SLinkList node4 = node3.InsertNext(4);

SLinkList node5 = node4.InsertNext(5);

node1.Traverse(null);

node3.DeleteNext(); // delete the node "4"

node2.Traverse(null);

}

Output

Traversing in Forward Direction

1
2
3
4
5

Traversing in Forward Direction

2
3
4

Software & Finance

C# - Singly Linked List

Related Links:

Source Code

Output