1.What is the time complexity for insertion in binary tree in worst case?
- O(log n)
- O(n log n)
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.
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