Computer Sciences > Gate 2015 Set-2 > Binary Tree
A binary tree T has 20 leaves. The number of nodes in T having two children is ________
Correct : a
Similar Questions
Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at...
Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at...
Let T be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves a and b of T are chosen uniformly and independently at...
Total Unique Visitors
Loading......