Lingo

Linked List Playground

Append nodes, then search the list and watch each node visited in turn.

Operations

Search is O(n) because there is no index — each node can only be reached from its predecessor.

12→5→27→ null

Three nodes chained head to tail.

3Nodes
0Visited
O(1) with a tail pointerAppend
O(n)Find