The time complexity of the add operation on a linked implementation would be O(n log n) if we chose to add at the end of the list instead of the front?

Question

Quizplus · Accepted Answer

Adding an element at the end of a singly linked list has a time complexity of O(n) because you have to traverse the entire list to find the last element. However, if you maintain a tail pointer, the time complexity can be reduced to O(1). The complexity does not involve log n factor as that is typically associated with operations that can divide the problem set, like binary search or balanced tree insertions.

The Time Complexity of the Add Operation on a Linked