Java

import java.io.*;
import java.util.*;

class LinkedList<T>
{
	private Node head;
	private Node last;
	private T data;

	public LinkedList()
	{
		head = null;
	}

	public boolean isEmpty()
	{
		return (head==null);
	}


	public void addToHead (T val)
	{
		Node n = new Node (val);
		n.next = head;
		head = n;
	}


	private class Node
	{
        public T data;
        public Node next;

        Node (T val)
        {
        	data = val;
        	next = null;
        }
	}




public void delete(T val)
{
	delete(head, val);
}

 public Node delete (Node curr, T val)
  {

  		Comparable <T> temp = (Comparable<T>)val;
		if (curr==null)
		{
			System.out.println("list empty");
		}else if ( temp.compareTo(curr.data)==0){
				curr = curr.next;
			}else{
				curr.next = delete(curr.next, val);
			}
			return curr;
 }



    public String toString()
    {
    	String str ="";
    	Node curr = head;
    	while(curr!=null)
    	{
    		str = str + curr.data + " ";
    		curr = curr.next;
    	}
    	return str + "\n";
    }




}//end linkedList

class Link
{
	public static void main(String[] arg)
	{
		LinkedList<Integer> s1 = new LinkedList<Integer>();
		s1.addToHead(23);
		s1.addToHead(78);
		s1.addToHead(100);

		s1.delete(23);
		System.out.println(s1.toString());
	}
}