linkedlist consist on nodes. A single node contains data and address of next node. There is always a head pointer at the start of list. It insertion is O(1) but it's searching is O(N).