Question

Given a singly linked list with 'n' nodes, what is the time complexity to delete the last node?

A O(1)
B O(log n)
C O(n)
D O(n log n)
E O(n^2)
Practice Next

Hey! Ask a query