Explore Curriculum Notes Playground

Loading...

Loading Curriculum...

Loading Subject...

Loading Topic...

Loading Lesson...

Data Structures and Algorithms Linked List

Deletion From End

Lesson 12/65

Loading Lab...

Linked List Operations - Delete Tail

Deletion From End

Deletion From End traverses to the node before tail, disconnects the old tail, and promotes the predecessor as the new tail.

TimeO(n)

SpaceO(1)

Try Interactive Simulator

Need Predecessor

A singly linked list cannot jump from tail back to the previous node.

Stop Early

Traversal stops when current.next is the tail.

Break Tail Link

prev.next becomes null.

Single Node Case

If there is only one node, deleting tail also clears head.

List valuesSelected value

Delete valueDelete positionN from end

Click a node to select itDrag nodes to reposition the chainDrag panel headers to rearrange toolsResize panel corners when space gets tight

Current Step

Start with previous behind current.

Speed