0
In a singly linked list that keeps only a head pointer, inserting a new node at the end of the list takes
- AO(1) time
- BO(log n) time
- CO(n²) time
- DO(n) time
Correct answer: D
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!