Question: In a full binary tree, every internal node has exactly two children. A full binary tree with 2n+1 nodes contains, A. 2n leaf nodes B.
In a full binary tree, every internal node has exactly two children. A full binary tree with 2n+1 nodes contains,
A. 2n leaf nodes
B. n+1 internal nodes
C. n+1 exterior nodes
D. n-1 internal nodes
Step by Step Solution
3.42 Rating (158 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
