Let's test your knowledge. Is this statement true or false?
Searching for an element in a linked list has a time complexity of O(n), where n is the number of nodes in the list.
Press true if you believe the statement is correct, or false otherwise.
Searching for an element in a linked list has a time complexity of O(n), where n is the number of nodes in the list.
Press true if you believe the statement is correct, or false otherwise.