testseries

Question

Time complexity circular LL

i think aswer is A . this Q is similar

to  https://gateoverflow.in/61880/complexity 

but here they  haven't mentioned about any pointer.

here is my explanation 

Answer 1

I did it this way. It will take constant amount of timr

Answer 2

 

if we insert a node in the middle of the list. then we have to traverse half of the list and it will take o(n) in best and worst case.

if we insert node at the starting of the node then it will take constant time

Comments

@mehul vaidya you are right . for starting it will take o(1)

---

I don't think  this code is correct 

Observe this lines

node *q = head;
        while(q->next = head)   // This loop take O(n) time
            q = q->next;

you are assigning head to q , 

then again you are traversing list  to find q-> next  = head.

(it uses = instead of ==)

after that you are doing 

temp->next = head;

(that means pointer to  start of Circular LL lost)

instead of 

temp->next = head-> next ;

---

thank you