Complete the implementation of the size and isEmpty operations of a binary tree, assuming that there is not a count variable.
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.