Respuesta :

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?

This is known to be the idea in computer science that handles  the quantification of the needed time frame that is taken by a set of code or algorithm to act or run as a function of the numbers of input.

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).

See full question below

. 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)

Learn more about Data structures from

https://brainly.com/question/24268720

#SPJ1