collections-------------->>>>>>>>>>>Linkedlist

LinkedList;   It is best for Insrtion and deletion operations

LL is Given by java.util.LinkedList Package.
programe;
import java.util.LinkedList;
class LnkdListExamp
{
public static void main(String[] args)
{LinkedList ll=new LinkedList();
ll.add("c");
ll.add("c");
ll.add("c");
ll.add("c");
ll.add("c");
System.out.println(ll);
ll.addFirst("f");
ll.addLast("l");
System.out.println(ll);

System.out.println(ll.getFirst());
System.out.println(ll.getLast());

}
}
output:
D:\anvesh_java>java LnkdListExamp
[c, c, c, c, c]
[f, c, c, c, c, c, l]
f
l





D:\anvesh_java>javap java.util.LinkedList
Compiled from "LinkedList.java"
public class java.util.LinkedList extends java.util.AbstractSequentialList imple
ments java.util.List,java.util.Deque,java.lang.Cloneable,java.io.Serializable{
    public java.util.LinkedList();
    public java.util.LinkedList(java.util.Collection);
    public java.lang.Object getFirst();
    public java.lang.Object getLast();
    public java.lang.Object removeFirst();
    public java.lang.Object removeLast();
    public void addFirst(java.lang.Object);
    public void addLast(java.lang.Object);
    public boolean contains(java.lang.Object);
    public int size();
    public boolean add(java.lang.Object);
    public boolean remove(java.lang.Object);
    public boolean addAll(java.util.Collection);
    public boolean addAll(int, java.util.Collection);
    public void clear();
    public java.lang.Object get(int);
    public java.lang.Object set(int, java.lang.Object);
    public void add(int, java.lang.Object);
    public java.lang.Object remove(int);
    public int indexOf(java.lang.Object);
    public int lastIndexOf(java.lang.Object);
    public java.lang.Object peek();
    public java.lang.Object element();
    public java.lang.Object poll();
    public java.lang.Object remove();
    public boolean offer(java.lang.Object);
    public boolean offerFirst(java.lang.Object);
    public boolean offerLast(java.lang.Object);
    public java.lang.Object peekFirst();
    public java.lang.Object peekLast();
    public java.lang.Object pollFirst();
    public java.lang.Object pollLast();
    public void push(java.lang.Object);
    public java.lang.Object pop();
    public boolean removeFirstOccurrence(java.lang.Object);
    public boolean removeLastOccurrence(java.lang.Object);
    public java.util.ListIterator listIterator(int);
    public java.util.Iterator descendingIterator();
    public java.lang.Object clone();
    public java.lang.Object[] toArray();
    public java.lang.Object[] toArray(java.lang.Object[]);
    static java.util.LinkedList$Entry access$000(java.util.LinkedList);
    static int access$100(java.util.LinkedList);
    static java.lang.Object access$200(java.util.LinkedList, java.util.LinkedLis
t$Entry);
    static java.util.LinkedList$Entry access$300(java.util.LinkedList, java.lang
.Object, java.util.LinkedList$Entry);
}


D:\anvesh_java>