Partition linked list around x

gistfile1.java

public Node partition(Node node, int x) {
    Node lessHead, lessTail, greaterHead, greaterTail;

    while (node != null) {
        Node next = node.next;
        node.next = null;
        if (node.data < x) {
            if (lessHead == null) {
                lessHead = lessTail = node;
            } else {
                lessTail.next = node;
                lessTail = lessTail.next;
            } 
        } else {
            if (greaterHead == null) {
                greaterHead = greaterTail = node;
            } else {
                greaterTail.next = node;
                greaterTail = greaterTail.next;
            } 
        }
        node = next;
    }
    if (lessHead == null) return graterHead;

    lesstTail.next = greaterHead;
    return lessHead;
}