Are you sure you're getting this? Is this statement true or false?
In a linked list, the time complexity for searching for an element in the worst-case scenario is O(n), where n is the number of elements in the linked list.
Press true if you believe the statement is correct, or false otherwise.