Linked List Inserting in sorted format
- by user2738718
package practise;
public class Node
{
public int data;
public Node next;
public Node (int data, Node next)
{
this.data = data;
this.next = next;
}
public int size (Node list)
{
int count = 0;
while(list != null){
list = list.next;
count++;
}
return count;
}
public static Node insert(Node head, int value)
{
Node T;
if (head == null || head.data <= value)
{
T = new Node(value,head);
return T;
}
else
{
head.next = insert(head.next, value);
return head;
}
}
}
This work fine for all data values less than the first or the head. anything greater than than doesn't get added to the list.please explain in simple terms thanks.
