Consider a binary tree π in which every node has either zero or two children.β¦
GATE Β· 2025 Β· CS Β· Set 2 Β· Computer Science & IT
Consider a binary tree π in which every node has either zero or two children. Let π > 0 be the number of nodes in π.
Which ONE of the following is the number of nodes in π that have exactly two children?
- A.
\(\frac{n - 2}{2}\) - B.
\(\frac{n - 1}{2}\) - C.
\(\frac{n }{2}\) - D.
\(\frac{n + 1}{2}\)
Attempted by 387 students.
Show answer
Correct answer: B
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lessonβ¦