What is the worst-case big-oh time complexity of each of the following problems?

Search an unsorted list of n elements for a given value. Search a sorted linked list of n elements for a given value. Search a binary search tree with n nodes for a given value Determine whether or not a sorted list of n elements has any duplicate values. Determine whether or not an unsorted list of n elements has any duplicate values