Top MCQs on Binary Trees Data Structure with Answers

Question 51

Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is

• Ω(logn)
• Ω(n)
• Ω(nlogn)
• Ω(n²)

Question 52

What is the worst case time complexity of inserting n² elements into an AVL-tree with n elements initially ?

• Θ(n⁴)
• Θ(n²)
• Θ(n² log n)
• Θ(n³)