Skip to main content

Delete all even parity nodes from circular linked list in node js

Js program for Delete all even parity nodes from circular linked list. Here problem description and explanation.

// Node JS program for
// Remove all even parity nodes from a circular single linked list
class LinkNode
{
	constructor(data)
	{
		this.data = data;
		this.next = null;
	}
}
class CircularLinkedList
{
	constructor()
	{
		this.head = null;
		this.tail = null;
	}
	insert(value)
	{
		var node = new LinkNode(value);
		if (this.head == null)
		{
			this.head = node;
		}
		else
		{
			this.tail.next = node;
		}
		node.next = this.head;
		this.tail = node;
	}
	// Display node element of circular linked list
	display()
	{
		if (this.head == null)
		{
			console.log("\n Empty Linked List");
		}
		else
		{
			process.stdout.write("\n Linked List Element \n");
			// First node of linked list
			process.stdout.write("  " + this.head.data);
			var temp = this.head.next;
			// Display linked list node
			while (temp != null && temp != this.head)
			{
				// Display node value
				process.stdout.write("  " + temp.data);
				// Visit to next node
				temp = temp.next;
			}
		}
	}
	// Handles the request to find set bits in given integer
	coutSetBit(num)
	{
		var result = num;
		result = result - ((result >>> 1) & 1431655765);
		result = (result & 858993459) + ((result >>> 2) & 858993459);
		result = (result + (result >>> 4)) & 252645135;
		result = result + (result >>> 8);
		result = result + (result >>> 16);
		result = result & 63;
		return result;
	}
	removeNode()
	{
		if (this.head == null)
		{
			return;
		}
		var temp = this.head;
		var auxiliary = this.head;
		var point = null;
		while (temp != null)
		{
			if (this.coutSetBit(temp.data) % 2 == 0)
			{
				auxiliary = temp;
				// Visit to next node
				temp = temp.next;
				if (auxiliary == this.head)
				{
					// Remove head node
					if (auxiliary == this.tail)
					{
						// Removing a single node
						this.tail = null;
						this.head = null;
						temp = null;
					}
					else
					{
						this.head = temp;
						this.tail.next = temp;
					}
				}
				else if (auxiliary == this.tail)
				{
					if (point != null)
					{
						// When Remove last node
						point.next = this.head;
					}
					this.tail = point;
				}
				else
				{
					if (point != null)
					{
						// When Remove last node
						point.next = temp;
					}
				}
				auxiliary = null;
			}
			else
			{
				point = temp;
				// Visit to next node
				temp = temp.next;
				if (temp == this.head)
				{
					// Stop the process
					temp = null;
				}
			}
		}
	}
}

function main()
{
	var cll = new CircularLinkedList();
	// Insert node
	cll.insert(3);
	cll.insert(12);
	cll.insert(32);
	cll.insert(14);
	cll.insert(27);
	cll.insert(19);
	cll.insert(1);
	cll.insert(18);
	process.stdout.write("\n Before Remove ");
	cll.display();
	/*
	    Node  Binary     Even Parity
	     3     (11)         Yes
	    12     (1100)       Yes
	    32     (100000)     No
	    14     (1110)       No
	    27     (11011)      Yes
	    19     (10011)      No
	    1         (1)       No        
	    18     (10010)      Yes
	*/
	cll.removeNode();
	process.stdout.write("\n\n After Remove");
	cll.display();
}
// Start program execution
main();

Output

 Before Remove
 Linked List Element
  3  12  32  14  27  19  1  18

 After Remove
 Linked List Element
  32  14  19  1




Comment

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