Data Structures :: Linked Lists - Discussion
Home > Data Structures > Linked Lists > MCQs Questions Discussion
10 / 48
Choose the correct option.
The time required to delete a node x from a doubly linked list having n nodes is
AO(n)
BO(log n)
CO(1)
DO(n log n)
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
No Discussion on this question yet!