A strictly binary tree with 10 leaves
2017
A strictly binary tree with 10 leaves
Answer: B. has exactly 19 nodes — In a strictly binary (full) tree, every internal node has exactly two children. This structure follows the relationship N = 2L - 1, where N is the total…
- A.
cannot have more than 19 nodes
- B.
has exactly 19 nodes
- C.
has exactly 17 nodes
- D.
has exactly 20 nodes
Attempted by 660 students.
Show answer & explanation
Correct answer: B
In a strictly binary (full) tree, every internal node has exactly two children. This structure follows the relationship N = 2L - 1, where N is the total number of nodes and L is the number of leaves.
Given L = 10 leaves, substitute into the formula: N = 2(10) - 1 = 19.
Thus, the tree contains exactly 19 nodes.
A video solution is available for this question — log in and enroll to watch it.
Explore the full course: Iocl Engineers Officers Grade A Paper 2