Use induction to prove that each function performs its stated task.
a. The function g computes the number of nodes in a binary tree:
b. The function h computes the number of leaves in a binary tree:
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.