It should be C.

O(n) means the time complexity for the given function is **not more than** c*n time where c is a constant.

But adding node at the end of list needs the whole list to be traversed and there is no upper or lower bound to it. It is **exactly equal** to c*n. So Theta(n).