Awesome q2a theme
0 votes

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

  1. O(1)
  2. O(log n)
  3. O(n)
  4. 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.

  1. O(n2)
  2. O(1)
  3. O(n)
  4. 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

in Algorithms by (381 points) | 52 views
AFAIK, Geeksforgeeks is better site for algo and ds
Should we do lots of problem  and again study theory portion to understand how algorithms work of particular subtopic rather than memorising by heart  result (complexity). Again thanks got the way of study algorithms

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
8,998 questions
3,130 answers
95,816 users