What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? - Study24x7
Social learning Network
study24x7

Default error msg

Login

New to Study24x7 ? Join Now
Already have an account? Login
17 Mar 2019 09:49 AM study24x7 study24x7

What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list?

A

O(1)

B

O(n)

C

θ(n)

D

θ(1)

study24x7
Write a comment
Related Questions
500+   more Questions to answer
Most Related Articles