• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | Sudo GATE 2020 Mock I (27 December 2019) | Question 49

Consider the following statements: I. The number of possible min-heaps containing each value from 7 indistinguishable element is 80. II. A max-heap can be constructed from a binary search tree in Θ(n) time. III. The kth smallest element in a max-heap can be found in O(log n) time. IV. A binary search tree can be constructed from a max-heap in O(n log n) time. Which of the above statements is/are TRUE ?


II, III and IV


I, II and III


I, III and IV


I, II and IV


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments