Queue is implemented as singly link list then complexity to add an element in the queue is ?

• O(1)
  
  Because the element is always added at the end of the linked list.
• 10 years agoHelpfull: Yes(9) No(0)
• o(1) bcoz we keep the pointers of both front as well as rear and whenever we add we add in the next of rear and update rear
• 10 years agoHelpfull: Yes(3) No(0)
• we can add elements in linked list at the end only , so complexity will be
  
  
• 10 years agoHelpfull: Yes(0) No(0)