java - How to make a linked list sorted?

Question

Write a java method in your Linked List Project to perform the sorted insertion in your Linked List. Sorted insertion is one in which, whenever you insert a new element, it is inserted on its sorted location. but I'm not getting the output here is my code.

{
  public void insertSorted(int data) 
{
    
    Node temp = new Node(data);
    if(head == null || head.Data > data) 
    {
        temp.next = head;
        head = temp;
    }
    Node head2 = head;
    while(head2.next != null && head2.next.Data < data) 
    {
        head2 = head2.next;
    }
    temp.next = head.next;
    head.next = temp;
}

public void Display() 
{
    Node t = head;
    while(t != null)
    {
        System.out.print(t.Data+" -> ");
        t = t.next;
    }
    System.out.println("NULL");
}
}

question from:https://stackoverflow.com/questions/65868839/how-to-make-a-linked-list-sorted

Answer 1

You can try this one it will work as you expected ->

 public void seprator1(Node curr) {
    if (curr == null || curr.next == null) {
        return;
    }

    Node Even, EvenTail, oddStartingNode, oddEndNode;

    Even = EvenTail = oddStartingNode = oddEndNode = null;

    while (curr != null) {
        if (curr.data % 2 == 0) {
            if (Even == null) {
                Even = curr;
                EvenTail = Even;
            } else {
                EvenTail.next = curr;
                EvenTail = EvenTail.next;
            }
        } else {
            if (oddStartingNode == null) {
                oddStartingNode = curr;
                oddEndNode = oddStartingNode;
            } else {
                oddEndNode.next = curr;
                oddEndNode = oddEndNode.next;
            }
        }

        curr = curr.next;
    }

    displayNode(Even);
    System.out.println();
    displayNode(oddStartingNode);

}

private void displayNode(Node node) {
    if (node == null) {
        return;
    }
    System.out.print(node.data+" ");
    displayNode(node.next);
}