Question

Data Sturctuers C++

The time complexity of inserting a new element into a dynamic array is O(1) because you can assign a value using a[i] = x;

Select one:

True

False

Question 2

The time complexity for inserting a value into a linked list at a specific index is when is O(1) because you can just use linkedlist.set( i, val)

Select one:

True

False

Question 3

The time complexity for inserting a value into a linked list after a specific node is when is O(1) because you have the location to insert at.

Select one:

True

False

Question 4

The time complexity for inserting a value into a linked list before a specific node is when is O(1) because you have the location to insert at.

Select one:

True

False

Answer 1

Answer

1)  True
2)  False
3)  True
4)  False