LinkedList is an implementation of linked list and double-ended queue data structures. : LinkedList « Utility Classes « SCJP

Home
SCJP
1.Java Source And Data Type
2.Operators
3.Modifiers
4.Type Casting
5.Statements
6.Object Oriented
7.Thread
8.Utility Classes
9.File
SCJP » Utility Classes » LinkedList 
8.15.1.LinkedList is an implementation of linked list and double-ended queue data structures.
LinkedList has methods called 
addFirst(), addLast(), getFirst(), getLast(), removeFirst(), and removeLast(). 

import java.util.LinkedList;

public class MainClass {
  public static void main(String[] argv) {
    LinkedList list = new LinkedList();

    list.addFirst("1");
    list.addLast("2");

    System.out.println(list);
  }
}
 
[1, 2]
8.15.LinkedList
8.15.1.LinkedList is an implementation of linked list and double-ended queue data structures.
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.