Remove every k th node of the linked list in scala

Scala program for Remove every k th node of the linked list. Here problem description and explanation.

// Scala Program for
// delete every k-th node of the linked list

// Linked list node
class LinkNode(var data: Int,
	var next: LinkNode)
{
	def this(data: Int)
	{
		this(data, null);
	}
}
class SingleLL(var head: LinkNode)
{
	def this()
	{
		this(null);
	}
	// Add new node at the end of linked list
	def addNode(value: Int): Unit = {
		// Create  node
		var node: LinkNode = new LinkNode(value);
		if (this.head == null)
		{
			this.head = node;
		}
		else
		{
			var temp: LinkNode = this.head;
			// Find last node
			while (temp.next != null)
			{
				// Visit to next node
				temp = temp.next;
			}
			// Add node at last position
			temp.next = node;
		}
	}
	// Display all Linked List elements
	def display(): Unit = {
		if (this.head != null)
		{
			var temp: LinkNode = this.head;
			while (temp != null)
			{
				// Display node value
				print("  " + temp.data);
				// Visit to next node
				temp = temp.next;
			}
		}
		else
		{
			println("Empty Linked list\n");
		}
	}
	def removeKh(kth: Int): Unit = {
		if (this.head == null)
		{
			// When no element
			println("Empty Linked list");
		}
		else if (kth <= 0)
		{
			println("\nInvalid position " + kth);
		}
		else
		{
			var temp: LinkNode = this.head;
			var hold: LinkNode = null;
			var checker: LinkNode = null;
			var count: Int = 0;
			if (kth == 1)
			{
				// When delete all element
				this.head = null;
			}
			while (temp != null)
			{
				count += 1;
				if (count % kth == 0)
				{
					// When delete node found
					hold = temp;
				}
				else
				{
					// Get current node
					checker = temp;
				}
				temp = temp.next;
				// When get free node
				if (hold != null)
				{
					if (checker != null)
					{
						// Unlink node
						checker.next = hold.next;
					}
					hold = null;
				}
			}
		}
	}
}
object Main
{
	def main(args: Array[String]): Unit = {
		var sll: SingleLL = new SingleLL();
		// Linked list
		// 1 → 2 → 3 → 4 → 5 → 6 → 7 → NULL
		sll.addNode(1);
		sll.addNode(2);
		sll.addNode(3);
		sll.addNode(4);
		sll.addNode(5);
		sll.addNode(6);
		sll.addNode(7);
		var position: Int = 2;
		println("Position : " + position);
		println("Before Delete Linked List");
		sll.display();
		sll.removeKh(position);
		println("\n After Linked List");
		sll.display();
	}
}

Output

Position : 2
Before Delete Linked List
  1  2  3  4  5  6  7
 After Linked List
  1  3  5  7



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







© 2022, kalkicode.com, All rights reserved