GATE CSE
First time here? Checkout the FAQ!
x
0 votes
35 views

Let P be a singly linked list. Let Q be the pointer to an intermediate node X in the list. What is the worst case time complexity of the best known algorithm to delete node X from the list?

A) O(n)

B) O(log n)

C) O(log n)

D) O(1)

closed as a duplicate of: GATE2004-IT-13
asked in DS by Veteran (10.7k points)  
closed by | 35 views
Top Users Jan 2017
  1. Debashish Deka

    8968 Points

  2. sudsho

    5326 Points

  3. Habibkhan

    4798 Points

  4. Bikram

    4532 Points

  5. Vijay Thakur

    4486 Points

  6. saurabh rai

    4222 Points

  7. Arjun

    4196 Points

  8. santhoshdevulapally

    3808 Points

  9. Sushant Gokhale

    3596 Points

  10. Kapil

    3486 Points

Monthly Topper: Rs. 500 gift card

19,212 questions
24,104 answers
53,152 comments
20,319 users