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

(a) N = 2*L

(b) N = L + 1

(c) N = L – 1

(d) N = 2*L – 1

Question is taken from Binary Tree Properties topic in section Binary Trees of Data Structures & Algorithms I

I have been asked this question in an interview for job.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
The correct answer is (d) N = 2*L – 1

The explanation is: The relation between number of nodes(N) and leaves(L) is N=2*L-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.