Delete Node
Route the predecessor's pointer around the node, then drop it.
Cost
- Best
- O(1)
- Average
- O(n)
- Worst
- O(n)
- Space
- O(1)
Before this
Related
Leads to
Topics that need this one first.
Taught by the same lesson
Singly Linked List covers these too, in the same run.