Multiple Choice
If the number of nodes in a binary tree is 2n (where n is a positive integer) , then the entire tree would contain at least
A) 2n + 1 nodes
B) 22n nodes
C) 2n + 1 - 1 nodes
D) 2n + 2 nodes
Correct Answer:

Verified
Correct Answer:
Verified
Related Questions
Q1: In a machine language,the technique in which
Q7: Suppose a binary tree contained the nodes
Q9: The table below represents a portion of
Q11: Which of the following is not a
Q13: Which of the following is not used
Q15: The table below represents a portion of
Q16: The table below represents a portion of
Q23: If the longest path in a binary
Q30: In a machine language,the technique in which
Q45: If a stack contained the entries w,x,y,z