Awesome q2a theme
0 votes
38 views

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)

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.

  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 (173 points) | 38 views
+1
AFAIK, Geeksforgeeks is better site for algo and ds
0
Thanks
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.
Top Users Feb 2020
  1. shashin

    363 Points

  2. Shaik Masthan

    79 Points

  3. SuvasishDutta

    39 Points

  4. srestha

    33 Points

  5. Mk Utkarsh

    32 Points

  6. neeraj_bhatt

    31 Points

  7. !KARAN

    30 Points

  8. Debapaul

    23 Points

  9. Pratyush Priyam Kuan

    18 Points

  10. kalra05

    18 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,316 questions
1,581 answers
10,277 comments
89,904 users