B 4.1.3 Worksheet 4 Java Answers
Search Complexity O(n): In an unsorted linked list, there's no information about where a particular value might be relative to other values. To find an element (or determine it's not there), you might have to check every single node from the beginning until you either find it or reach the end of the list. This is a linear scan.Could it be O(1)? Yes, if the element you are searching for happens to be the very first...