edited by
564 views
1 votes
1 votes

How to solve such a problem?

edited by

Please log in or register to answer this question.

Related questions

6 votes
6 votes
2 answers
1
Vishal Goyal asked Dec 6, 2016
731 views
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
5 votes
5 votes
2 answers
2
Utkarsh Joshi asked Nov 24, 2018
3,446 views
The minimum number of comparisons required to find the 65th smallest element in a minheap is equal to
1 votes
1 votes
1 answer
3
sunaina rawat asked Nov 7, 2017
733 views
The number of min heap trees are possible with 15 elements such that every leaf node must be greater than all non-leaf nodes of the tree are ________.
1 votes
1 votes
1 answer
4