Singly Linked List

O(n) search

insertAtHead(val): newNode = new Node(val) newNode.next = head head = newNode

Length0

HeadNULL

TailNULL

Active / Traversing

Found / Target

Deleting / Miss