jamiahmcq
Answered

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 O(1).

The average time complexity of accessing the kth element in a linked list is O(1).

The average time complexity of inserting data into a heap is O(logN)

Answer :

Martebi

The  2 statements that correctly describe the time complexity of data structures with N data are:

  • The average time complexity of data structures with N data is O(N).
  • The average time complexity of inserting data into a heap is O(logN)

What is Time Complexity in the above case/

This is known to be the amount of times a specific instruction set is executed instead of the total time is taken.

Note that The  2 statements that correctly describe the time complexity of data structures with N data are:

  • The average time complexity of data structures with N data is O(N).
  • The average time complexity of inserting data into a heap is O(logN)

Learn more about data structure from

https://brainly.com/question/13147796

#SPJ1

Other Questions