Java Linked List — Free Java Tutorial

TL;DR: Learn Java Linked List in Java with a free, beginner-friendly tutorial, examples and practice for Indian students on Syllab.in.

Java Linked List in Java

java.util.LinkedList is a doubly linked list that implements both List and Deque interfaces. Each element stores references to the previous and next nodes.

LinkedList excels at O(1) insertions and deletions at the head or tail, but has O(n) random access by index (unlike ArrayList which is O(1)).

As a Deque, LinkedList can be used as a queue (FIFO) with offer()/poll() or as a stack (LIFO) with push()/pop().

Use LinkedList when you frequently add/remove from the beginning or middle of a list. Use ArrayList when you need fast random access by index.

LinkedList<String> list = new LinkedList<>();
list.addFirst("x");      // add to head
list.addLast("z");       // add to tail
list.removeFirst();      // remove from head
list.removeLast();       // remove from tail
list.getFirst();         // peek at head

// Queue usage
Queue<String> q = new Linke

Learn Java Linked List step by step with Syllab's free interactive Java tutorial — runnable code examples, practice exercises and instant AI feedback, all free with no signup. Explore the full Java course →