(Solved): 3. Choose 2 statements that correctly describe the time complexity of data structures with N data. ...

3. Choose 2 statements that correctly describe the time complexity of data structures with N data. The average time complexity of the data lookup in a hash table is O(N). The average time complexity of the data lookup in a complete binary tree is O(logN). The average time complexity of deleting an item from an array is 0(1). The average time complexity of accessing the kth element in a linked list is 0(1). The average time complexity of inserting data into a heap is O(logN)