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)
<h3>What is Time Complexity in the above case/</h3>
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
brainly.com/question/13147796
#SPJ1
Answer:
The <u>alink (active link)</u> color appears while the mouse is clicking the link. The <u>vlink (visited link)</u> is the color of the link after the user has already visited it.
