Delete nodes which have a greater value on right side

public static LinkedList DeleteRight(LinkedList node){
if(node==null)
return null;
LinkedList prev = null;
LinkedList head = node;
int max = 0;
while(node!=null) {
if(max < node.value){
max = node.value;
prev = node;

}
else
prev.next = node.next;
node=node.next;
}
return head;
}