A binary search tree T contains n distinct elements. What is the time – McqOptions

MCQOPTIONS

1.	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?
A.	Θ(1)
B.	Θ(n log n)
C.	Θ(log n)
D.	Θ(n)
Answer» B. Θ(n log n)

Discussion

No Comment Found

Related MCQs

For construction of a binary heap with property that parent node has value less than child node. In reference to that which line is incorrect. Line indexed from 1.
Given an array of element 5, 7, 9, 1, 3, 10, 8, 4. Which of the following are the correct sequences of elements after inserting all the elements in a min-heap?
State the complexity of algorithm given below.
What is the location of a parent node for any arbitary node i?
Given the code, choose the correct option that is consistent with the code. (Here A is the heap)
What is the best case complexity in building a heap?
A binary search tree is used to locate the number 43. Which one of the following probe sequence is not possible?
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?
Priority queue is implemented by:
Consider the following two statements.1. A binary tree T is full if each node is either a leaf or possesses exactly two child nodes.2. A binary tree T with n levels is complete if all levels except possibly the last are completely full, and the last level has all its nodes to the left side.Which statement is/are TRUE