GATE CSE 2021 Set 1 | Question: 10 | Video Solution
in DS recategorized by
0 votes
0 votes

A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$?

  1. $\Theta(n\log n)$
  2. $\Theta(n)$
  3. $\Theta(\log n)$
  4. $\Theta (1)$
in DS recategorized by
1.4k points

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.