![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
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) |
Answer» C. θ (n) |
View all MCQs in
Data Structure and Algorithms (DSA)No comments yet