An implementation of single Linked List in java.

SingleLinkedList.java

import java.util.Arrays;

public class SingleLinkedList {

  Node head;
	int i = 0;

	void insert(SingleLinkedList li, Node x) {
		x.next = li.head;
		li.head = x;
	}

	Node search(SingleLinkedList li, int key) {
		Node x = li.head;
		while (x != null && x.key != key) {
			x = x.next;
		}
		return x;
	}
}

class Node {
	Node next;
	int key;

	Node(int key) {
		this.key = key;
	}
}

//Testing the algorithm
class Test {
	public static void main(String args[]) {
		SingleLinkedList sl = new SingleLinkedList();
		sl.insert(sl, new Node(4));
		sl.insert(sl, new Node(3));
		sl.insert(sl, new Node(9));
		sl.insert(sl, new Node(6));
		System.out.println(sl.search(sl, 20).key);
	}
}