In a doubly linked list, deleting a node given only a pointer to that node…

TPSC Computer/IT Posts 2026

In a doubly linked list, deleting a node given only a pointer to that node (not to its predecessor) has time complexity

  1. A.

    O(n)O(n)

  2. B.

    O(log⁡n)O(\log n)

  3. C.

    O(n2)O(n^2)

  4. D.

    O(1)O(1)

Attempted by 82 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…