Question

The time required to delete a node x from a doubly

linked list having n nodes is

A O (n)

B O (log n)

C O (1)

D O (n log n)

E None

Practice Next

More IT Networking Questions

Solution