+1 vote
in Data Structures & Algorithms I by (110k points)
In a full binary tree if number of internal nodes is I, then number of nodes N are?

(a) N = 2*I

(b) N = I + 1

(c) N = I – 1

(d) N = 2*I + 1

This interesting question is from Binary Tree Properties in chapter Binary Trees of Data Structures & Algorithms I

The question was asked by my school teacher while I was bunking the class.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
The correct answer is (d) N = 2*I + 1

The explanation is: Relation between number of internal nodes(I) and nodes(N) is N = 2*I+1.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...