A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Important Notice!

Dear users, compscibits.com is now permanently moved to compsciedu.com. Please update all your links and bookmarks accordingly. Soon, the site will be accessible through URL compsciedu.com only.

Discussion Forum

Que. In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time
a. Θ(n log n)
b. Θ(n)
c. Θ(log n)
d. Θ(1)
Answer:Θ(1)
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: