• retagged by
39,080 views
57 57 votes
Consider a binary tree T that has $200$ leaf nodes. Then the number of nodes in T that have exactly two children are ______.

14 Answers

0 0 votes
L= no of leaf nodes, i1= internal node1 with child, i2= internal node2 with child
Formula:
                      [ L= i2+1 ]
so here L=200 then,
                                 200=i2+1
                                   i2=199
So number of nodes in T that have exactly two children are 199.
Answer:
Position:
Show:

Related questions

51 51 votes
5 answers 5 answers
15.1k
15.1k views
go_editor asked Feb 14, 2015
15,123 views
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
69 69 votes
5 answers 5 answers
21.1k
21.1k views
go_editor asked Feb 16, 2015
21,059 views
Consider the following C program:#include<stdio.h int f1(void); int f2(void); int f3(void); int x=10; int main() { int x=1; x += f1() + f2 () + f3() + f2(); printf("%d", ...
13 13 votes
3 3 answers
11.0k
11.0k views
go_editor asked Feb 16, 2015
11,030 views
The velocity $v$ (in kilometer/minute) of a motorbike which starts form rest, is given at fixed intervals of time $t$ (in minutes) as follows:t2468101214161820v1018252932...
46 46 votes
7 answers 7 answers
12.9k
12.9k views
go_editor asked Feb 16, 2015
12,892 views
Suppose $c = \langle c[0], \dots, c[k-1]\rangle$ is an array of length $k$, where all the entries are from the set $\{0, 1\}$. For any positive integers $a \text{ and } n...