In a binary max heap containing n numbers, the smallest element can be – McqOptions

MCQOPTIONS

1.	In a binary max heap containing n numbers, the smallest element can be found in _________ time?
A.	O(n)
B.	O(log2n)
C.	O(1)
D.	O(n*n)
Answer» B. O(log2n)

Discussion

No Comment Found

Related MCQs

Preorder is
What is the formula to be used to calculate the total number of comparisons in bubble sort with n elements after k iterations?
Information about an array used in a program will be stored in
Which sorting method is slowest?
In a binary max heap containing n numbers, the smallest element can be found in _________ time?
Choose the correct answer Stack is useful for implementing
A complete binary tree with 5 levels has how many nodes? (root is level 1)
Ashima wants to print a pattern which includes checking and changing a variables value iteratively She decides to use a loop/condition Which of the following options should she use such that the body of the loop/condition is executed at least once whether the variable satisfies the entering condition or not ?