Delete a node from linked list specific position in csharp

Csharp program for Delete a node from linked list specific position. Here problem description and explanation.

// Include namespace system
using System;
// Csharp Program for
// Delete node at given index of linked list

// Linked list node
public class LinkNode
{
	public int data;
	public LinkNode next;
	public LinkNode(int data)
	{
		this.data = data;
		this.next = null;
	}
}
public class SingleLL
{
	public LinkNode head;
	public LinkNode tail;
	public SingleLL()
	{
		this.head = null;
		this.tail = null;
	}
	// Add new node at the end of linked list
	public void addNode(int value)
	{
		// Create a new node
		var node = new LinkNode(value);
		if (this.head == null)
		{
			this.head = node;
		}
		else
		{
			this.tail.next = node;
		}
		this.tail = node;
	}
	// Display linked list element
	public void display()
	{
		if (this.head == null)
		{
			return;
		}
		var temp = this.head;
		// iterating linked list elements
		while (temp != null)
		{
			Console.Write(temp.data + " → ");
			// Visit to next node
			temp = temp.next;
		}
		Console.WriteLine("NULL");
	}
	// Delete node at given position
	public void deleteAtIndex(int index)
	{
		var temp = this.head;
		if (this.head == null)
		{
			Console.WriteLine("Empty linked list");
			return;
		}
		else if (index < 0)
		{
			Console.WriteLine("Invalid positions");
			return;
		}
		else if (index == 1)
		{
			// Means deleting a first node
			if (this.tail == this.head)
			{
				// Only one node
				this.tail = null;
			}
			// Make second node as head
			this.head = this.head.next;
		}
		else
		{
			var count = index - 1;
			// iterating linked list elements and find deleted node
			while (temp != null && count > 1)
			{
				// Visit to next node
				temp = temp.next;
				count--;
			}
			if (count == 1 && temp.next != null)
			{
				// Get deleted node
				var n = temp.next;
				if (n == this.tail)
				{
					// When delete last node
					this.tail = temp;
				}
				// Unlink the deleting node
				temp.next = n.next;
			}
			else
			{
				Console.WriteLine(" Index " + index + " are not present");
				return;
			}
		}
	}
	public static void Main(String[] args)
	{
		var sll = new SingleLL();
		// Test with your index
		// Note index start with 1
		var index = 5;
		// Linked list
		// 10 → 20 → 30 → 40 → 50 → 60 → 70 → 80 → NULL
		sll.addNode(10);
		sll.addNode(20);
		sll.addNode(30);
		sll.addNode(40);
		sll.addNode(50);
		sll.addNode(60);
		sll.addNode(70);
		sll.addNode(80);
		Console.WriteLine(" Before Delete Linked List");
		sll.display();
		// Delete node at 5-th position
		sll.deleteAtIndex(index);
		// Display linked list
		Console.WriteLine(" After Delete Linked List");
		sll.display();
	}
}

Output

 Before Delete Linked List
10 → 20 → 30 → 40 → 50 → 60 → 70 → 80 → NULL
 After Delete Linked List
10 → 20 → 30 → 40 → 60 → 70 → 80 → NULL


Please share your knowledge to improve code and content standard. Also submit your doubts, and test case. We improve by your feedback. We will try to resolve your query as soon as possible.

New Comment







© 2021, kalkicode.com, All rights reserved