public static Node<Integer> deleteNode(Node<Integer> lst,int ch){
if (lst.getValue()
== ch)
return lst.getNext();
Node<Integer> prev = lst, curr = lst.getNext();
while (curr != null) {
if (curr.getValue()
== ch) {
prev.setNext(curr.getNext());
return lst;
}
else {
curr = curr.getNext();
prev = prev.getNext();
}
}
return lst;
}