Vector: O(n^2) Hash Table: O(n) Binary Tree: O(n log n) For the vector data structure, the worst-case running time for reading the file and creating course objects is O(n * m), where ‘n’ is the number ...