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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Data Structures and Other Objects Using Java Questions!