jamiahmcq
contestada

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)

Respuesta :

Martebi

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

  • The average time complexity of the data lookup in a hash table is O(N).
  • The average time complexity of inserting data into a heap is O(logN)

What is time complexity of data structures?

Time Complexity of an algorithm is known to be the depiction of the amount of time needed by the algorithm to carry out to completion.

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

  • The average time complexity of the data lookup in a hash table is O(N).
  • The average time complexity of inserting data into a heap is O(logN)

Learn more about data from

https://brainly.com/question/17350816

#SPJ1

Otras preguntas