To find an element with value X
in a linked list with n nodes requires how many
nodes to be visited in the worst case?
n nodes\log n nodesn^2 nodesHow many nodes might we have to visit to find the one that we are looking for?