edited by
622 views
1 votes
1 votes

The number of nodes of height $\mathrm{h}$ in any $\mathrm{n}$-element heap is atmost:

  1. $n / 2^{n+1}$
  2. $\frac{n}{2^{h-1}}$
  3. $\frac{n}{2^{h}}$
  4. $\frac{n-1}{2^{h-1}}$
edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
2
admin asked Oct 23, 2022
971 views
Using $\text{'RSA'}$ algorithm, if $p=13, q=5$ and $e=7$. the value of $d$ and cipher value of $'6'$ with $(e, n)$ key are$7, 4$$7, 1$$7, 46$$55,1$
0 votes
0 votes
1 answer
4
admin asked Oct 23, 2022
324 views
Size and complexity are a part ofPeople MetricsProject MetricsProcess MetricsProduct Metrics