Academic Resource
Aptitude
Data Interpretation
Verbal Reasoning
Non Verbal Reasoning
Verbal Ability
Programming
General Knowledge
Puzzle
Engineering
Computer Engineering
Electronics and Communication
Electrical Engineering
Mechanical Engineering
Civil Engineering
Biotechnology
Architecture & Planning
Online Test
Aptitude Test
Data Interpretation Test
Verbal Reasoning Test
Non Verbal Reasoning Test
Verbal Ability Test
Exams
More
Full Forms
Home
»
Programming & Data Structure
»
Programming and data structure miscellaneous
» Question
Programming and data structure miscellaneous
Easy Questions
Programming & Data Structure
Programming and data structure miscellaneous
Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number operations to convert the tree to a heap is
Ω(log n)
Ω(n)
Ω(n log n)
Ω(n
2
)
Correct Option:
A
NA
Previous Question
Next Question
Your comments will be displayed only after manual approval.
Post your Comment
