Prove by induction diat a binary tree with n nodes has exacriy n + 1 empty subtrees (or, in Java terms, n + 1 null references).
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.