Top
/
Data structures
/
Lists
/
Nondestructive
/
Answer-linkedlist1-3
Answer to Question linkedlist1-3
O(
n
). Each item in the list is looked at once, and it takes a constant amount of time to add it into the sum.