For any nonempty binary tree, let n₀,n₁,n₂ count zero-,one-,two-child nodes. The edge count gives n₁+2n₂=n₀+n₁+n₂−1, hence n₂=n₀−1. With two hundred leaves this is one hundred ninety-nine.
More Trees and Binary Search Trees questions
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:…
GATE 2026 CS (CS2) Q12– The set T represents various traversals over a binary tree. The set S represents the order…