Course contentsShow
← Java
Lesson 1025 of 2,87024. List ImplementationsFree lesson

Removing the First Element

How unlinkFirst() updates head, nulls out references, and adjusts the new first node's prev pointer.

Removing the First Element from a LinkedList

In this lesson, you'll learn how LinkedList efficiently removes its head node by updating references and cleaning up memory.

When you remove the first element from a LinkedList, Java's implementation uses an internal method called unlinkFirst(). This operation demonstrates the power of linked structures: no shifting of elements is required—just a few pointer adjustments.

How unlinkFirst() Works

The process involves three critical steps:

1. Capture the Current Head

The method saves a reference to the current head node, which contains the element to be removed. This node will soon be unlinked from the list.

2. Update the Head Reference

The head pointer is reassigned to point to the second node in the list (the current head's next reference). This effectively makes the second node the new first node.

3. Clean Up References

To help the garbage collector and maintain list integrity:

  • The old head's next pointer is set to null (severing its connection to the list)
  • The old head's data reference is set to null (releasing the element)
  • The new head's prev pointer is set to null (since it's now first and has no predecessor)

This last step is crucial: the new first node must have a null prev pointer because nothing comes before it.

Why This Is O(1)

No matter how many elements are in the list, removing the first element always takes the same number of steps—just updating three or four references. There's no array copying, no shifting—just pointer manipulation.

Key Takeaway: unlinkFirst() removes the head by updating the head reference to the second node, nulling out the old head's connections, and ensuring the new head's prev pointer is null—a constant-time operation.