In Java im trying to use a recursive wrapper method for inserting a node in a linkedlist in order but Im having trouble figuring out how to sort these nodes. Any help would be greatly appreciated.

private Node insert(int key, Node head) {

if(!find(key)) { /** if(key > head.data && head.link == null) { Node curr = new Node(key); head.link = curr; return curr = head; }

if(key > head.data) { return insert(key, head.link); } if(key < head.data) { Node temp = head; head = new Node(key); return head.link = temp; } **/ Node curr = new Node(key);

curr.link = head;

head = curr; }

return insert(key, head.link); }