Segregate even and odd nodes in sorted order in node js

Js program for Segregate even and odd nodes in sorted order. Here problem description and other solutions.

// Node JS program for
// Segregate even and odd nodes in ascending order

// Linked list node
class LinkNode
{
	constructor(data)
	{
		this.data = data;
		this.next = null;
	}
}
class SingleLL
{
	constructor()
	{
		this.head = null;
	}
	// Add new node at the end of linked list
	insert(value)
	{
		// Create a node
		var node = new LinkNode(value);
		if (this.head == null)
		{
			this.head = node;
		}
		else
		{
			var temp = 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
	display()
	{
		if (this.head != null)
		{
			var temp = this.head;
			while (temp != null)
			{
				// Display node value
				process.stdout.write("  " + temp.data);
				// Visit to next node
				temp = temp.next;
			}
		}
		else
		{
			console.log("Empty Linked list");
		}
	}
	sortedAdd(element)
	{
		if (this.head == null)
		{
			this.head = element;
		}
		else if (this.head.data >= element.data)
		{
			element.next = this.head;
			this.head = element;
		}
		else
		{
			var temp = this.head;
			// Finding location of inserting node
			while (temp.next != null && 
                   temp.next.data < element.data)
			{
				// Visit to next node
				temp = temp.next;
			}
			// Add node 
			element.next = temp.next;
			temp.next = element;
		}
	}
	segregateNode(odd, even)
	{
		var node = null;
		// Iterating the linked list node
		while (this.head != null)
		{
			node = this.head;
			// Visit to next node
			this.head = node.next;
			// Set null to next node
			node.next = null;
			if (node.data % 2 == 0)
			{
				// When node value is Even
				even.sortedAdd(node);
			}
			else
			{
				// When node value is Odd
				odd.sortedAdd(node);
			}
		}
	}
}

function main()
{
	// Create linked lists
	var sll = new SingleLL();
	var odd = new SingleLL();
	var even = new SingleLL();
	// Linked list sll
	// 4 → 3 → 5 → 2 → 11 → 1 → 6 → NULL
	sll.insert(4);
	sll.insert(3);
	sll.insert(5);
	sll.insert(2);
	sll.insert(11);
	sll.insert(1);
	sll.insert(6);
	console.log("Initial Element");
	// Display all node
	sll.display();
	sll.segregateNode(odd, even);
	console.log("\nEven Element");
	// Display all even node
	even.display();
	console.log("\nOdd Element");
	// Display all odd node
	odd.display();
}
// Start program execution
main();

Output

Initial Element
  4  3  5  2  11  1  6
Even Element
  2  4  6
Odd Element
  1  3  5  11