Skip to content
Related Articles
Open in App
Not now

Related Articles

Data Structures | Heap | Question 9

Improve Article
Save Article
Like Article
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article
Like Article

In a binary max heap containing n numbers, the smallest element can be found in time 









Answer: (A)


In a max heap, the smallest element is always present at a leaf node. So we need to check for all leaf nodes for the minimum value. Worst case complexity will be O(n)

        /  \\
      /      \\
    8         7
   / \\        / \\
 /     \\    /     \\
2      3   4       5

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!