order singly linked list nodes based on value

gistfile1.java

public class SinglyNode {
	public SinglyNode next = null;
	public int value;
	
	public SinglyNode(int d)
	{
		value = d;
	}
	
	public static SinglyNode orderNodes(SinglyNode node, int value)
	{
		SinglyNode tortoise = node;
		SinglyNode lessThan = null;
		SinglyNode moreThan = null;
		
		while(tortoise != null)
		{
			if (tortoise.value < value)
			{
				placeNode(lessThan, tortoise);
			}
			else
			{
				placeNode(moreThan, tortoise);
			}
			tortoise = tortoise.next;
		}
		
		mergeLists(lessThan, moreThan);
		return lessThan;
	}
	
	public static void mergeLists (SinglyNode headListLeft, SinglyNode headListRight)
	{
		if(headListLeft.next == null)
		{
			headListLeft.next = headListRight;
			return;
		}
		else
		{
			mergeLists(headListLeft.next, headListRight);
		}
	}
	
	public static void placeNode (SinglyNode head, SinglyNode p)
	{
		if (head == null)
		{
			head = copyNode(p);
			return;
		}
		
		if (head.next == null)
		{
			head.next = copyNode(p);
		}
		else
		{
			placeNode(head.next, p);
		}
	}
	
	public static SinglyNode copyNode(SinglyNode p)
	{
		return new SinglyNode(p.value);
	}
}