Consider the singly linked list. What is the worst-case time complexity of the best-known algorithm to delete the node a, pointer to this node is q, from the list?

1
O(1)
2
O(lg n)
3
O(n)
4
O(n lg n)

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation