Let n₀,n₁,n₂ be counts of nodes with zero,one,two children. Counting edges gives n₁+2n₂=n₀+n₁+n₂−1. Therefore n₂=n₀−1=19, regardless of the number of one-child nodes.
More Trees and Binary Search Trees questions
GATE 2015 CS (CS3) Q21– A binary tree has 200 leaves. How many nodes have exactly two children?
GATE 2015 CS (CS3) Q27– Insert 71,65,84,69,67,83 into an empty binary search tree in this order. Which element is…
GATE 2021 CS (CS2) Q26– In a complete binary tree with seven nodes, A is the set of the first three nodes visited…
GATE 2026 CS (CS1) Q33– The height of a binary tree is the number of edges in the longest path from the root to a…
GATE 2026 CS (CS1) Q40– Let P be the set of all integers from 1 to 15. Consider any order of insertion of the…
GATE 2026 CS (CS1) Q62– The following sequence corresponds to the preorder traversal of a binary search tree T:…