A binary tree is strictly binary if every nonleaf node has exactly two children. Prove by induction on tire number of leaves that a strictly binary tree with n leaves has exactly 2n - 1 nodes.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.