LIVE Course for free

Rated by 1 million+ students
Get app now
0 votes
35 views
in Computer by (71.8k points)
closed by

A complete binary min-heap is made by including each integer in [1, 1023] exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is _____.

1 Answer

+1 vote
by (70.8k points)
selected by
 
Best answer

Correct answer is 8

nth smallest element will be present within ‘n’ levels of min heap

Welcome to Sarthaks eConnect: A unique platform where students can interact with teachers/experts/students to get solutions to their queries. Students (upto class 10+2) preparing for All Government Exams, CBSE Board Exam, ICSE Board Exam, State Board Exam, JEE (Mains+Advance) and NEET can ask questions from any subject and get quick answers by subject teachers/ experts/mentors/students.

Categories

...