The time required to delete a node x from a doubly linked list having n nodes is

Options
- O (n)
- O (log n)
- O (1)
- O (n log n)

CORRECT ANSWER : O (1)

Discussion Board
Data Structure - Doubly Linked List

The time required to delete a node x from a doubly linked list having n nodes is O(1). Doubly linked list is a sequence of elements in which every node has link to its previous node and next node. Traversing can be done in both directions and displays the contents in the whole list.

Prajakta Pandit 02-1-2017 06:52 AM

Searching the node

Does this not include the time it takes to search for the node?

Michael 02-28-2015 01:36 PM

Write your comments


Enter the code shown above:

(Note: If you cannot read the numbers in the above image, reload the page to generate a new one.)


Related Content

Advertisement
 
▲