AFAIK, Geeksforgeeks is better site for algo and ds

Awesome q2a theme

0 votes

1.What is the time complexity for insertion in binary tree in worst case?

- O(1)
- O(log n)
- O(n)
- O(n log n)

2.

An array ′A′has n distinct integers. What is the tightest time complexity to check A[i]=i for some i. Consider all elements of array within range from 1 to n.

- O(n2)
- O(1)
- O(n)
- O(logn)

PS:For solving these types of questions please suggest study resource I already know these are my weak topic15 day before exam but could't improve till now

8,998 questions

3,130 answers

14,378 comments

95,816 users